## Nonconvex QP via piecewise affine models

Convenient generation of approximations

Convenient generation of approximations

Performance fix and extended interp1

A little known solver

Give your solver a hint

Improvements in bmibnb, interp1 and sdisplay

Extracting inputs and outputs from solvers

There is more than one way to skin a cat

Some more fixes…

Update for cplex bug

New solvers and minor patches

Both patches and new features

Unintended consequences of an improved optimizer framework

Slice’n dice your problems

It’s been a while…

Where to start?

MATLAB no longer required! Recommended though.

Hard? Let’s try anyway.

Using YALMIP objects and code in Simulink models, easy or fast, your choice.

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...

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

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?

Files and exercise material from the YALMIP work-shop at the Swedish control conference 2010

Ever wondered how to compute the L1 Chebyshev ball?

Name your constraints for easy reference

Where why how?

Avoid that for-loop by using vector objectives

Code works for almost all cases, but suddenly fails.

Added a sum-of-squares example focusing on pre- and post-processing capabilities.

sqrt, sqrtm, power or cpower?