Projection and restriction methods in geometric programming and related problems

DOI10.1007/BF00933271zbMath0369.90115OpenAlexW4235590392MaRDI QIDQ1243242

K. Appert

Publication date: 1978

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

The limiting Lagrangian as a consequence of Helly's theorem, Method of reduction in convex programming, Converse and symmetric duality in complex nonlinear programming, Existence theory for the complex linear complementarity problem

Cites Work

• Characterization of optimality in convex programming without a constraint qualification
• Degenerate quadratic programming and \(\ell_p\) approximation problems
• Fenchel and Lagrange duality are equivalent
• Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming
• Complementarity Theorems for Linear Programming
• Symmetric Duality for Generalized Unconstrained Geometric Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item