Sciweavers

58 search results - page 5 / 12
» Graph-based quadratic optimization: A fast evolutionary appr...
Sort
View
ARCS
2006
Springer
13 years 11 months ago
Biologically-Inspired Optimization of Circuit Performance and Leakage: A Comparative Study
State-of-the-art technologies in very large scale integration (VLSI) allow for the realization of gates with varying energy consumptions and hence delays (i.e., processing speeds) ...
Ralf Salomon, Frank Sill
GPEM
2002
163views more  GPEM 2002»
13 years 7 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
SIAMSC
2010
215views more  SIAMSC 2010»
13 years 5 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
CDC
2008
IEEE
139views Control Systems» more  CDC 2008»
14 years 1 months ago
Iterative Risk Allocation: A new approach to robust Model Predictive Control with a joint chance constraint
Abstract— This paper proposes a novel two-stage optimization method for robust Model Predictive Control (RMPC) with Gaussian disturbance and state estimation error. Since the dis...
Masahiro Ono, Brian C. Williams
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
13 years 7 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...