Symmetrized Separable Convex Programming

DOI10.2307/1998774zbMath0431.90064OpenAlexW4234275021MaRDI QIDQ3869096

L. McLinden

Publication date: 1979

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

zbMATH Keywords

dualityindicator functionoptimal Lagrange multipliersgeometric programmingLagrangian dualityFenchel conjugatepolyhedral functionsseparable convex programmingepigraph setFenchel preconjugatenonclosed functionsperturbational dualityprojected modelSlater existence criterion

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Affine minorants minimizing the sum of convex functions
• Constrained duality via unconstrained duality in generalized geometric programming
• Optimality conditions in generalized geometric programming
• Saddle points and duality in generalized geometric programming
• Extension of Fenchel's duality theorem for convex functions
• Geometric Programming
• Explicit duality for convex homogeneous programs
• The Duality between Suboptimization and Parameter Deletion
• Symmetric Duality for Structured Convex Programs
• Level Sets and Continuity of Conjugate Convex Functions
• Duality theorems for convex functions