## Bilevel programming alternatives

Optimization over optimization problems in three different ways.

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

Tropical algebra, esotheric but easily modelled and solved in YALMIP.

Model predictive control, receding horizon control, discrete-time dynamic planning, or what ever you want to call it.

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

Annoyingly hard to do nicely with a nice theoretical framework. Let’s try dynamic programming.

Dynamic programming based LPV control of the Henon attractor.

Robust optimization in MPC, a perfect case for YALMIP

Common question: how can I solve a nonconvex QP using SeDuMi? Weird question, but interesting answer.

Ever wondered how the L1 Chebyshev ball can be computed?

Markowitz classical portfoilos and beyond via integer programming.

Using YALMIPs symmetry reduction to reduce size of sum-of-squares problems

Let YALMIP do the hard work

Solving Sudoku games using YALMIP. Easy and slow model, or complicated and fast.

Mixed-integer optmization with logical modelling