Questions and discussions on YALMIP and related optimization modelling issues are now handled using Google groups.

Hope to see you at the YALMIP Q/A forum!.

Nov 15 2012

Questions and discussions on YALMIP and related optimization modelling issues are now handled using Google groups.

Hope to see you at the YALMIP Q/A forum!.

Jun 13 2014

I have been asked several times if I would consider an Octave port. My answer has been no, based on my, as it turns out, flawed idea that it would require a lot of changes (and my general lack of interest in Octave). Well, yet another request came, and I decided to download Octave and test it. Turned out the changes required were absolutely minimal. Hence, as of now, YALMIP runs in both MATLAB and Octave.

Feb 21 2014

Feb 17 2014

Jun 26 2013

I have been asked frequently recently whether is is possible to have YALMIP code in Simulink simulations. The answer is yes, but there are some caveats.

Feb 13 2013

Minor release with some small enhancements and, for the first time in 10 years probably, support for a new SDP solver.

Jan 30 2013

A common application of integer programming is the unit commitment problem in power generation, i.e., scheduling of set of power plants in order to meet a current and forecasted power demand while minimizing costs.

To see how such a problem is modeled in YALMIP, a unit commitment example is now available.

If you would like to see how additional constraints or logic behaviour can be added to the model, let me know!

Jan 24 2013

Jan 11 2013

The command optimizer is used to reduce overhead when solving a large number of optimization problems which only differ through some changing parameter in the model. Previously, this feature has been limited to models where the changing parameter has entered the model affinely. Read more...

May 15 2012

In coming versions of YALMIP, the operators **>** and **<** will most likely not be allowed in constraints. Hence, to prepare, you should replace occurrences of these operators with **<=** and **>=**.

Nov 28 2011

Important release. A massive performance degradation was accidentally added to the two most recent releases. Hence, the latest release should be installed.

Aug 31 2011

A common question I get is along the lines *"how can I solve a nonconvex QP using SeDuMi"*

Feb 09 2011

A question on the YALMIP forum on the SeDuMi homepage essentially boiled down to *"how can I generate sum-of-squares solutions which really are feasible, i.e. true certificates"*
Read more...

Feb 08 2011

I was asked by a colleague today on how to compute the worst-case ∞-norm of a matrix **A(p)** linearly parameterized in an uncertainty **p** constrained to a polytope.
Read more...

Sep 22 2010

A paper describing the robust optimization module has been accepted for publication.

Sep 10 2010

Philipp Rostalski has made his Convex Algebraic Geometry Wiki public. Among other things, you can find the tool Bermeja, which is partly based on YALMIP.

Jun 11 2010

Ever wondered how to compute the L_{1} Chebyshev ball? Check out the new article on polytopic geometry using YALMIP and MPT

Jun 11 2010

Material from the mini-course on YALMIP and MPT for Optimization and Modelling in Control at the Swedish control meeting is now available for download. Please note that you need the latest release to run some of the examples.

May 06 2010

CPLEX 12, which now is shipped with MATLAB support, is now supported in YALMIP.

May 05 2010

I am very pleased to announce that YALMIP now supports the mixed-integer linear programming solver Gurobi. The solver is interfaced via Gurobi mex developed by Wotao Yin.

Aug 29 2009

A new sum-of-squares example has been made available. This example concentrates on the pre-processing capabilities of YALMIPs sum-of-squares module.

Apr 28 2009

A poster and a related paper (Löfberg:2008b) presenting the robust optimization module has been uploaded to the Wiki.