Convex Duality Made Difficult
+simply denotes the set of vectors which is nonnegative in each coordinate.Definition 2.2 (Lagrangian of an optimization problem).Let 0 : R R, 1 , . . . , 1 , . . . be a standardform convex optimization problem, as in Definition 2.1.Then the Lagrangian of this problem is the function : R R + R R defined by (;, ) = 0 () + () +
Authors
- Eigil Fjeldgren Rischel (ORCID: https://orcid.org/0000-0002-1145-2753)
Publication Details
- Journal
- Electronic Proceedings in Theoretical Computer Science
- Published
- 2026-03-08
- DOI
- https://doi.org/10.4204/eptcs.442.1
- Primary Topic
- Mathematical Inequalities and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00