Nonconvex long-short constraints
There is more than one way to skin a cat
New release R20170626
Some more fixes…
New release R20170624
Update for cplex bug
New release R20170622
New solvers and minor patches
New release R20160930
Both patches and new features
Sample-based robust optimization
Unintended consequences of an improved optimizer framework
Extensions on the optimizer
Slice’n dice your problems
New release R20160923
It’s been a while…
Debugging infeasible models
Where to start?
Octave support in YALMIP
MATLAB no longer required! Recommended though.
Worst-case norms of matrices
Hard? Let’s try anyway.
YALMIP and Simulink
Using YALMIP objects and code in Simulink models, easy or fast, your choice.
Unit commitment example - logic and integer programming
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 cu...
Nonconvex quadratic programming
Common question: how can I solve a nonconvex QP using SeDuMi? Weird question, but interesting answer.
Strictly feasible sum-of-squares solutions
A question on the YALMIP forum essentially boiled down to how can I generate sum-of-squares solutions which really are feasible, i.e. true certificates?
Work-shop material
Files and exercise material from the YALMIP work-shop at the Swedish control conference 2010
Polytopic geometry using YALMIP and MPT
Ever wondered how to compute the L1 Chebyshev ball?
Tagging constraints
Name your constraints for easy reference
NaN in model
Where why how?
Computing multiple solutions in one shot
Avoid that for-loop by using vector objectives
Constraints without any variables
Code works for almost all cases, but suddenly fails.
New sum-of-squares example
Added a sum-of-squares example focusing on pre- and post-processing capabilities.
Working with square roots
sqrt, sqrtm, power or cpower?