InteractiveMap of Operations Research
Back to Optimization Core
TheoryAdvanced02.05
Optimization Core

Convex Optimization

Where every local optimum is global.

Overview

Convex optimization is the tractable core of nonlinear decision modeling. When the feasible set and objective are convex, local optimality is global and duality becomes a practical diagnostic tool.

It is especially useful for portfolios, signal processing, estimation, energy dispatch, and machine-learning-adjacent models where reliability matters more than combinatorial detail.

Core ideas

Convex sets

Convexity makes interpolation feasible and turns local optimality into global optimality.

KKT

Optimality conditions combine feasibility, stationarity, multipliers, and complementarity.

Conic programming

Conic programming is a core checkpoint for Convex Optimization: define it concretely, attach units or rules where possible, and test whether stakeholders interpret it the same way.

Lagrangian duality

Lagrangian duality is a core checkpoint for Convex Optimization: define it concretely, attach units or rules where possible, and test whether stakeholders interpret it the same way.

Proximal methods

Proximal methods is a core checkpoint for Convex Optimization: define it concretely, attach units or rules where possible, and test whether stakeholders interpret it the same way.

How to use it

  1. 1Start with Portfolio: write the decision, time horizon, actors, and objective in operational language.
  2. 2Translate the problem into Convex sets, KKT, and Conic programming; define units and data sources for each one.
  3. 3Build a small instance of Convex Optimization that can be solved or simulated by hand inspection before using full production data.
  4. 4Compare the recommendation against a baseline policy, not just against mathematical optimality.
  5. 5Document assumptions, sensitivity results, and the conditions under which the recommendation should be revisited.

Applications

PortfolioSignal processingMLControlEnergy dispatch
  • Portfolio: compare feasible policies, quantify the operating tradeoffs, and make the assumptions behind the recommendation visible.
  • Signal processing: compare feasible policies, quantify the operating tradeoffs, and make the assumptions behind the recommendation visible.
  • ML: compare feasible policies, quantify the operating tradeoffs, and make the assumptions behind the recommendation visible.
  • Control: compare feasible policies, quantify the operating tradeoffs, and make the assumptions behind the recommendation visible.
  • Energy dispatch: compare feasible policies, quantify the operating tradeoffs, and make the assumptions behind the recommendation visible.

Common pitfalls

  • Applying Convex Optimization because the label sounds appropriate while leaving the actual decision boundary vague.
  • Treating Convex sets as a technical detail instead of a modeling choice that affects the recommendation.
  • Reporting one answer without showing sensitivity to demand, capacity, costs, or behavioral assumptions.
  • Ignoring implementation details such as data quality, explainability, ownership, and how users will override bad recommendations.

Resources