Fenchel and Lagrange duality are equivalent
From MaRDI portal
Publication:4050398
DOI10.1007/BF01585523zbMath0296.90037OpenAlexW2077049643MaRDI QIDQ4050398
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585523
Related Items
On the relationship between fenchel and Lagrange duality for optimization problems in general spaces ⋮ Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation ⋮ Multipliers and general Lagrangians ⋮ Φ-Conjugation and noneonvex optimization. a survey (part III) ⋮ Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements ⋮ Dual gauge programs, with applications to quadratic programming and the minimum-norm problem ⋮ A complete characterization of strong duality in nonconvex optimization with a single constraint ⋮ Are dualities appropriate for duality theories in optimization? ⋮ Projection and restriction methods in geometric programming and related problems ⋮ Symmetric and asymmetric duality ⋮ Comments on the general duality survey by J. Tind and L.A. Wolsey ⋮ A generalization of Fenchel duality theory
Cites Work
