Sciweavers

24 search results - page 5 / 5
» Lagrangian Dual Interior-Point Methods for Semidefinite Prog...
Sort
View
AUTOMATICA
2010
90views more  AUTOMATICA 2010»
13 years 4 months ago
A line search improvement of efficient MPC
A recent lifting technique led to a computationally efficient Model Predictive Control (MPC) strategy in which the online optimization is performed using a univariate Newton-Raphs...
Basil Kouvaritakis, Shuang Li, Mark Cannon
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 4 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
ICML
2008
IEEE
14 years 5 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 8 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa