Skip to content

Constrained and Convex Optimisation

A fully invested book must satisfy the budget 1⊤w=1\mathbf{1}^\top\mathbf{w}=1, which an unconstrained optimum need not satisfy. Lagrange multipliers convert that equality into an extended stationary system; inequality constraints such as long-only weights add complementary slackness in the KKT conditions. A convex objective on a convex feasible set upgrades a local minimum to a global one. This note develops those tools with a portfolio budget as the running example.
Learning objectives. By the end of this note you should be able to:
  • form a Lagrangian and solve a one-equality constrained problem;
  • interpret λ\lambda as a shadow price;
  • state the KKT idea for simple inequalities;
  • recognise convex objectives / constraints so local minima are global, with a portfolio reading.

In this lesson

  1. Equality constraints and Lagrange
  2. Inequalities and the KKT idea
  3. Convexity: local becomes global

Before you start

The full lesson, with worked examples and exercise solutions, is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.