Explicit duality for convex homogeneous programs

DOI10.1007/BF01580666zbMath0346.90036MaRDI QIDQ4116258

C. Roger Glassey

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

Symmetrized Separable Convex Programming ⋮ On KKT points of homogeneous programs ⋮ A strong duality theorem for the minimum of a family of convex programs ⋮ Dual gauge programs, with applications to quadratic programming and the minimum-norm problem ⋮ A quadratic network optimization model for equilibrium single commodity trade flows ⋮ Duality in continuous-time homogeneous programming

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
• Duality in quadratic programming
• Duality in Homogeneous Programming
• A duality theorem for non-linear programming
• Convergence Conditions for Nonlinear Programming Algorithms
• Convex Analysis
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• A Note on Pseudoinverses

This page was built for publication: Explicit duality for convex homogeneous programs