From manual labour to a one-liner
Doing the forbidden
Sort of convex but not quite
Common question: how can I solve a nonconvex QP using SeDuMi? Weird question, but interesting answer.
Working with polynomials, function values, derivatives, integrals and their properties
Untangle that messy expression
Convenient generation of approximations
There is more than one way to skin a cat
Using YALMIP objects and code in Simulink models, easy or fast, your choice.
Unintended consequences of an improved optimizer framework
Optimization over optimization problems in three different ways.
Neither convex nor nonconvex. Bisection to the rescue for quasi-convex semidefinite program.
Solving mixed-integer maxdet problems and exploiting duality
Dynamic programming based LPV control of the Henon attractor.
Annoyingly hard to do nicely with a nice theoretical framework. Let’s try dynamic programming.
Solving MPC problems explicitly using various strategies, including dyanamic programming.
Hybrid and nonconvex models in model predictive control simplified by general high-level operators in YALMIP
Let YALMIP do the hard work
Tropical algebra, esotheric but easily modelled and solved in YALMIP.
Using YALMIPs symmetry reduction to reduce size of sum-of-squares problems
Ever wondered how the L1 Chebyshev ball can be computed?
Markowitz classical portfoilos and beyond via integer programming.
Robust optimization in MPC, a perfect case for YALMIP
Model predictive control, receding horizon control, discrete-time dynamic planning, or what ever you want to call it.
Solving Sudoku games using YALMIP. Easy and slow model, or complicated and fast.
Mixed-integer optmization with logical modelling