Symmetrized Separable Convex Programming

DOI10.2307/1998774MaRDI QIDQ3869096zbMATH OpenOpenAlexFDO

Authors L. McLinden

Publication date 1979

Full work available at URL https://doi.org/10.2307/1998774

zbMATH Keywords

dualityepigraph setFenchel conjugateFenchel preconjugategeometric programmingindicator functionLagrangian dualitynonclosed functionsoptimal Lagrange multipliersperturbational dualitypolyhedral functionsprojected modelseparable convex programmingSlater existence criterion

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites work

• Affine minorants minimizing the sum of convex functions
• Constrained duality via unconstrained duality in generalized geometric programming
• Duality theorems for convex functions
• Explicit duality for convex homogeneous programs
• Extension of Fenchel's duality theorem for convex functions
• Geometric Programming
• scientific article; zbMATH DE number 3465097 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• scientific article; zbMATH DE number 3187148 (Why is no real title available?)
• scientific article; zbMATH DE number 3078855 (Why is no real title available?)
• Level Sets and Continuity of Conjugate Convex Functions
• Optimality conditions in generalized geometric programming
• Saddle points and duality in generalized geometric programming
• Symmetric Duality for Structured Convex Programs
• The Duality between Suboptimization and Parameter Deletion

Cited in

(2)

• Decomposition through formalization in a product space
• Symmetric Duality for Structured Convex Programs

This page was built for publication: Symmetrized Separable Convex Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869096)