Questions and discussions related to YALMIP and related optimization modelling issues are now handled using Google groups. Over the years, a forum has been lacking, and the SeDuMi forum has been used as an ad-hoc solution, but with the increasing amount of spam seen there, and in the comment fields here, a solid solution is required.
Hope to see you at the YALMIP Q/A forum!.
Minor release with some small enhancements and, for the first time in 10 years probably, support for a new SDP solver.
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!
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...
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 >=.
A common question I get is along the lines "how can I solve a nonconvex QP using SeDuMi"
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...
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...
A paper describing the robust optimization module has been accepted for publication.
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.