Basic Prerequisites: Mean–Variance Optimization & the Efficient Frontier and Multivariable Calculus & Convex Optimization. (these are the folder-level prerequisites for pages 02–06; page 01 states its own, smaller, entry requirements)


1. Intuition & Practical Objective

Mean–variance optimization returns a mathematical point: . On six assets with realistic inputs that point is - a -levered, short-saturated book that no mandate can hold, and whose construction from an equal-weight portfolio costs of notional in one rebalance. Constraints and transaction costs are the difference between that point and a portfolio you can actually run. This folder is about the second problem: given a forecast and a mandate and a cost model, what do you hold, and what do you trade?

Everything in the folder is one of four objects:

  • A feasible set. Long-only, position caps, group/sector bounds, turnover budgets - a convex polytope . Its shadow prices are the price of your mandate.
  • A cost function. Linear (, the spread: Roll’s , Glosten–Milgrom’s ), quadratic (, impact à la Almgren–Chriss and Kyle’s ), or concave (the empirical square-root law, generalized-Roll spread ).
  • A trade-off. Turnover on one axis, net alpha on the other; the optimum sits where marginal alpha equals marginal cost - exactly the true cost, verified numerically below.
  • A dynamic. Across periods you trade partially toward a long-horizon aim, not to the current target: the Gârleanu–Pedersen policy .

This page is the folder’s hub: it gives the fast formula lookup below (job #1) and routes you to six sub-pages - intuition → constraints → cost models → turnover & multi-period → failure modes → extensions.

The one-sentence essence. “The implementable portfolio solves - and because the cost term has a kink at , the optimal answer is frequently to not trade at all.”


2. Mathematical Ground Truth & Derivations

Quick-Reference Lookup (job #1). Formulas are transcribed from Lobo–Fazel–Boyd (2007), Gârleanu–Pedersen (2013), Almgren–Chriss (2000) and Hasbrouck (2007, Ch 3/5/7/8); the check-column numbers were re-executed and reproduced exactly on the folder’s shared universe ( assets, monthly returns, seed fixed; risk aversion ; starting portfolio ; assumed linear cost bp; quadratic impact ).

Notation: weights, current weights, , covariance, risk aversion, linear costs, impact coefficients, half-spread, adverse-selection/impact cost, the feasible set.

QuantityFormulaVerified check
Unconstrained optimum
Gross exposure ( levered, unimplementable)
One-way turnoverblind ; capped ; from-EW naive
Constrained QPlong-only ; cap
Shadow price of a binding constraintgroup cap : /mo /yr
Group cap ⇔ alpha haircutalphas
Linear costblind net → cost-aware net ;
Quadratic impactimpact: , net , net
Square-root impact (concave, non-convex) cost most expensive at ( vs quadratic)
No-trade half-width, band , bp: , band
Turnover-penalty frontierutility peaks at the true cost ()
Multi-period trackingramp path; objective vs all-at-once ()
Aim / partial adjustment (quadratic impact; 04’s proportional-cost form is ), trade
Cross-asset coupling (off-diagonals are large - do not scalarise)
Roll spread (Hasbrouck Ch 3), spread -
Glosten–Milgrom spread (Ch 5, )-
Generalized Roll (Ch 8)spread , only identified
Kyle price impact (Ch 7), depth -

The critical interpretation caveat. The static, diagonal-, one-period problem above is an idealization. Three corrections matter in production: (i) the trades are coupled through - the fraction you close is a matrix , not a scalar; (ii) impact is not additive across correlated names (use a full or the factor form ); (iii) the empirical impact law is concave, so it must be convexified by successive convex approximation. All three are developed in 06 · Advanced Extensions.


3. Computational Implementation - the cost-aware engine

One universe, one solver: unconstrained, cost-blind long-only, linear-cost, and linear-plus-impact. Runs on numpy + scipy and reproduces every number in the table’s check column.

The engine makes the folder’s central claim numerically: pricing the trade turns a strategy into a one while cutting turnover by - and in the linear-cost solution two weights sit exactly at their current , the signature of the no-trade region.


4. Failure Modes & First-Principles Breakdowns

Hub signposts - the folder’s failure-mode analysis lives in 05 · Failure Modes & Practice. In one line each:

  1. Cost underestimation. Optimizing with overtrades; assuming zero cost costs of achievable certainty equivalent. Assuming double the cost is also wrong but paralyzes instead ().
  2. Turnover explosion. A cost-blind optimizer on a bp/month-noisy alpha turns over /yr; cost-awareness cuts it to /yr and raises net alpha ().
  3. Constraint interaction & tracking drift. A turnover budget leaves a permanent gap ( gap ; ); a group cap that duplicates a per-name cap is free but invisible without its multiplier.

5. References

  • Lobo, Fazel & Boyd (2007). Portfolio Optimization with Linear and Fixed Transaction Costs. Annals of Operations Research 152:341–365. The modeling backbone: convex cost-aware QPs, the no-trade region, the fixed-cost relaxation. ★ MUST-HAVE
  • Gârleanu & Pedersen (2013). Dynamic Trading with Predictable Returns and Transaction Costs. Journal of Finance 68(6):2309–2340. The aim portfolio and the closed-form partial-adjustment policy. ★ STRONG
  • Almgren & Chriss (2000/01). Optimal Execution of Portfolio Transactions. Journal of Risk 3(2):5–39. Permanent + temporary impact and the trading frontier. Cross-pillar: owned by Pillar 2 (optimal execution). ★ STRONG
  • Grinold & Kahn (2000). Active Portfolio Management, 2nd ed., McGraw-Hill. The practitioner’s bible for constrained active portfolios, tracking error and cost-adjusted rebalancing. ★ MUST-HAVE
  • Hasbrouck (2007). Empirical Market Microstructure, OUP. *Ch 3 (Roll: , spread )
  • Clarke, de Silva & Thorley (2002). Portfolio Constraints and the Fundamental Law of Active Management. FAJ 58(5):48–66. The transfer coefficient the price of constraints. ★ STRONG
  • Boyd, Busseti, Diamond, Kahn, Koh, Nystrup & Speth (2017). Multi-Period Trading via Convex Optimization. FnT in Optimization 3(1):1–72. The multi-period convex formulation and its implementations.

6. Connected Graph Bridges

Beginner: start at 01 · Practitioner: start at 05