Integrating piecewise affine functions
From manual labour to a one-liner
Sorting with linear programming, or?
Doing the forbidden
Star-convex polygons
Sort of convex but not quite
Nonconvex quadratic programming comparisons
Common question: how can I solve a nonconvex QP using SeDuMi? Weird question, but interesting answer.
Designing polynomials
Working with polynomials, function values, derivatives, integrals and their properties
Modelling if-else-end statements
Untangle that messy expression
Nonconvex QP via piecewise affine models
Convenient generation of approximations
Nonconvex long-short constraints - 7 ways to count
There is more than one way to skin a cat
Simulink models with YALMIP components
Using YALMIP objects and code in Simulink models, easy or fast, your choice.
Sample-based robust optimization
Unintended consequences of an improved optimizer framework
Bilevel programming alternatives
Optimization over optimization problems in three different ways.
Decay rate computation in LTI system
Neither convex nor nonconvex. Bisection to the rescue for quasi-convex semidefinite program.
Experiment design in system identification
Solving mixed-integer maxdet problems and exploiting duality
Model predictive control - LPV models redux
Dynamic programming based LPV control of the Henon attractor.
Model predictive control - LPV models
Annoyingly hard to do nicely with a nice theoretical framework. Let’s try dynamic programming.
Model predictive control - Explicit multi-parametric solution
Solving MPC problems explicitly using various strategies, including dyanamic programming.
Model predictive control - Hybrid models
Hybrid and nonconvex models in model predictive control simplified by general high-level operators in YALMIP
State feedback design for LPV system
Let YALMIP do the hard work
MAXPLUS control
Tropical algebra, esotheric but easily modelled and solved in YALMIP.
Pre- and post-processing sum-of-squares programs
Using YALMIPs symmetry reduction to reduce size of sum-of-squares problems
Polytopic geometry using YALMIP and MPT
Ever wondered how the L1 Chebyshev ball can be computed?
Portfolio optimization
Markowitz classical portfoilos and beyond via integer programming.
Model predictive control - robust solutions
Robust optimization in MPC, a perfect case for YALMIP
Model predictive control - Basics
Model predictive control, receding horizon control, discrete-time dynamic planning, or what ever you want to call it.
Sudoku solver
Solving Sudoku games using YALMIP. Easy and slow model, or complicated and fast.
Unit commitment
Mixed-integer optmization with logical modelling