Quant Memo
Advanced

Slater's Condition and Strong Duality

A simple check that guarantees a constrained optimization problem's dual solution gives exactly the same answer as the original problem, with no gap between the two.

Prerequisites: ADMM: The Alternating Direction Method of Multipliers

Many optimization problems in portfolio construction — minimizing risk subject to constraints on turnover, sector exposure, or leverage — can be attacked two ways: solve the original ("primal") problem directly, or solve a related ("dual") problem built from the constraints, which is often easier. In general, the dual problem's best value is only a lower bound on the primal's ("weak duality"); it can genuinely fall short. Strong duality is the stronger property that the two values are exactly equal, which makes the dual a fully reliable stand-in for the primal.

Slater's condition is a simple sufficient check for strong duality in convex problems: if there exists at least one point that satisfies every inequality constraint strictly — with some room to spare, not sitting exactly on a boundary — then strong duality is guaranteed to hold. It's a mild requirement in practice: most realistic portfolio constraints (a leverage cap, a sector limit) leave room for at least some strictly feasible portfolio, so Slater's condition is usually satisfied without special effort.

Worked example

Minimizing portfolio variance subject to a leverage constraint wi2\sum |w_i| \le 2 is a convex problem. The all-cash portfolio (w=0w = 0) satisfies the constraint strictly (0<20 < 2), so Slater's condition holds and strong duality is guaranteed — solving the dual problem (often faster or with a cleaner structure) gives exactly the same optimal variance as solving the primal problem directly, with zero gap to worry about.

Slater's condition — the existence of one point that strictly satisfies every inequality constraint — guarantees strong duality in convex optimization, meaning the dual problem's answer exactly matches the primal's, which is what makes duality-based solvers trustworthy rather than just approximate.

Related concepts

Further reading

  • Boyd & Vandenberghe, Convex Optimization, ch. 5
ShareTwitterLinkedIn