Prepare your code for the future!

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 >=.

The reason for this change is that strict operators cause confusion. The notion of a strict inequality has little support in practice, as almost all solvers approach the optimal solution from infeasibility, and thus easily ends up with non-strict feasibility, or even slight infeasibility. YALMIP has never treated strict and non-strict inequalities differently, but only supported strict inequalities as a notational convenience. If you need strictly feasible solutions, you should manually add a suitable margin to your non-strict constraint.

The next version of YALMIP will issue warnings when strict inequalities are encountered.

Release 20120420

Minor release fixing some small issues.

Read more...

Solving nonconvex QPs

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

Read more...

Strictly feasible sum-of-squares solutions

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...

Worst-case matrix norm

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...

Robust optimization paper

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

Convex Algebraic Geometry

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.

Polytopic geometry using YALMIP and MPT

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

Swedish control conference mini-course material

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.

CPLEX 12

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

Old releases

Release 20120316

Minor release fixing some small issues.

Read more...

Release 20120309

Minor release fixing some small issues.

Read more...

Release 20120109

Minor release fixing some small issues.

Read more...

Release 20111128

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

Read more...

Release 20111118

Minor release fixing some small issues.

Read more...

Release 20111111

Minor release fixing some small issues.

Read more...

Release 20111021

Minor release fixing some small issues.

Read more...

Release 20111014

Minor release fixing some small issues in the last major release and improving performance in the robust optimization module.

Read more...

Release 20110930

Major release with large internal changes in the robust optimization module, support for qpOASES and QuadprogBB, some new syntax in handling optimization problems, and some minor bug fixes. Read more...

Release 20110608

New release with some fixes mainly related to the robust optimization module.

Read more...

GlossyBlue theme adapted by David Gilbert
Powered by BlogIt