Explicit duality for convex homogeneous programs

DOI10.1007/BF01580666MaRDI QIDQ4116258zbMATH OpenFDO

Authors C. Roger Glassey

Publication date 1976

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01580666

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• A duality theorem for non-linear programming
• A Note on Pseudoinverses
• Convergence Conditions for Nonlinear Programming Algorithms
• Convex Analysis
• Duality in Homogeneous Programming
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Duality in quadratic programming
• scientific article; zbMATH DE number 3291744 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• 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

Cited in

(6)

• Duality in continuous-time homogeneous programming
• 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
• Symmetrized Separable Convex Programming
• A quadratic network optimization model for equilibrium single commodity trade flows
• On KKT points of homogeneous programs

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

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