YALMIP : a toolbox for modeling and optimization in MATLAB
Published 21 March 2005
Johan Löfberg
Citations9,229
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Free MATLAB toolbox YALMIP is introduced, developed initially to model SDPs and solve these by interfacing eternal solvers by making development of optimization problems in general, and control oriented SDP problems in particular, extremely simple.
Abstract
The MATLAB toolbox YALMIP is introduced. It is described how YALMIP can be used to model and solve optimization problems typically occurring in systems and control theory. In this paper, free MATLAB toolbox YALMIP, developed initially to model SDPs and solve these by interfacing eternal solvers. The toolbox makes development of optimization problems in general, and control oriented SDP problems in particular, extremely simple. In fact, learning 3 YALMIP commands is enough for most users to model and solve the optimization problems
Keywords
MathematicsEngineering
Optimization methods & softwareUsing SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
7,460 Citations1999J.F. Sturm
This paper describes how to work with SeDuMi, an add-on for MATLAB, which lets you solve optimization problems with linear, quadratic and semidefiniteness constraints by exploiting sparsity.
Scientific Repository (Petra Christian University)Predictive Control With Constraints
4,317 Citations2001J.M. Maciejowski
A standard formulation of Predictive Control is presented, with examples of step response and transfer function formulations, and a case study of robust predictive control in the context of MATLAB.
Society for Industrial and Applied Mathematics eBooksInterior-Point Polynomial Algorithms in Convex Programming
4,275 Citations1994Yurii Nesterov, Arkadi Nemirovski
This book describes the first unified theory of polynomial-time interior-point methods, and describes several of the new algorithms described, e.g., the projective method, which have been implemented, tested on "real world" problems, and found to be extremely efficient in practice.
AutomaticaThe explicit linear quadratic regulator for constrained systems
3,181 Citations2002Alberto Bemporad, Manfred Morari +2 more
A technique to compute the explicit state-feedback solution to both the finite and infinite horizon linear quadratic optimal control problem subject to state and input constraints is presented, and it is shown that this closed form solution is piecewise linear and continuous.
SIAM Journal on OptimizationGlobal Optimization with Polynomials and the Problem of Moments
2,548 Citations2001Jean B. Lasserre
It is shown that the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): R n to R, in a compact set K defined byPolynomial inequalities reduces to solving an (often finite) sequence of convex linear matrix inequality (LMI) problems.
Optimization methods & softwareSDPT3 — A Matlab software package for semidefinite programming, Version 1.3
1,881 Citations1999Kim-Chuan Toh, Michael J. Todd +1 more
This invention relates to stabilizing compositions that comprises a vinyl chloride or vinylidene chloride homopolymer or copolymer and a stabilizing amount of an organotin halide exhibiting the formula RSnX3.
Mathematical ProgrammingSemidefinite programming relaxations for semialgebraic problems
1,556 Citations2003Pablo A. Parrilo
It is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility and provide a constructive approach for finding bounded degree solutions to the Positivstellensatz.
Lecture notes in computer scienceMulti-Parametric Toolbox (MPT)
969 Citations2004Michal Kvasnica, P. Grieder +2 more
A Multi-Parametric Toolbox (MPT) for computing optimal or suboptimal feedback controllers for constrained linear and piecewise affine systems is under development at ETH.
SIAM Journal on Matrix Analysis and ApplicationsDeterminant Maximization with Linear Matrix Inequality Constraints
656 Citations1998Lieven Vandenberghe, Stephen Boyd +1 more
An interior-point method for maximizing the determinant of a matrix subject to linear matrix inequalities is described, with a simplified analysis of the worst-case complexity and numerical results that indicate that the method is very efficient, both in theory and in practice.
eCommons (Cornell University)SDPT3 -- A Matlab Software Package for Semidefinite Programming
647 Citations1996Kim-Chuan Toh, Michael J. Todd +1 more
Introducing SOSTOOLS: a general purpose sum of squares programming solver
551 Citations2003S. Prajna, Antonis Papachristodoulou +1 more
The paper provides an overview on sum of squares programming, describes the primary features of SOSToolS, and shows how SOSTOOLS is used to solve sum of square programs.
ACM Transactions on Mathematical SoftwareGloptiPoly
381 Citations2003Didier Henrion, Jean B. Lasserre
On the NP-hardness of solving bilinear matrix inequalities and simultaneous stabilization with static output feedback
337 Citations2005O. Toker, Hitay Özbay
The main result of this paper shows that the problem of checking the solvability of BMIs is NP-hard, and hence it is rather unlikely to find a polynomial time algorithm for solving general BMI problems.
Optimization methods & softwarePENNON: A code for convex nonlinear and semidefinite programming
294 Citations2003Michal Kočvara, Michael Stingl
A computer program PENNON for the solution of problems of convex Nonlinear and Semidefinite Programming (NLP-SDP), a generalized version of the Augmented Lagrangian method, originally introduced by Ben-Tal and Zibulevsky for convex NLP problems.
Lean backstepping design for a jet engine compressor model
68 Citations2002Miroslav Krstić, P.V. Kokotović
KYPD: a solver for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma
14 Citations2005Ragnar Wallin, Anders Hansson
KYPD is a customized solver for KYP-SDPs that utilizes the inherent structure of the optimization problem thus improving efficiency significantly.
On the implementation of primal-dual interior-point methods for semidefinite programming problems derived from the KYP lemma
11 Citations2004Lieven Vandenberghe, V. Balakrishnan +2 more
This work discusses fast implementations of primal-dual interior-point methods for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma, a class of problems that are widely encountered in control and signal processing applications.