Convex Optimization
Duality, KKT conditions, and interior-point methods.
Convex Optimization. Duality, KKT conditions, and interior-point methods.
Foundations and canonical references
The standard treatments of convex optimization approach the subject from complementary angles. Boyd, Convex Optimization (2004) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Rockafellar, Convex Analysis (1970) provides historical context and an early systematic exposition of the material.
Open methodological questions for convex optimization include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2004Convex Optimizationboyd-2004, vandenberghe-2004
- textbook · historical · 1970Convex Analysisrockafellar-1970
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.