Geometric programming: Duality in quadratic programming an l_p- approximation III (Degenerate programs)

DOI10.1016/0022-247X(70)90085-5MaRDI QIDQ2531202zbMATH OpenFDO

Authors J. G. Ecker, Elmor L. Peterson

Publication date 1970

Published in Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-247X(70)90085-5

zbMATH Keywords

operations research

Cites work

• A Duality Theorem for Convex Programs
• A duality theorem for non-linear programming
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• Duality and stability in extremum problems involving convex functions
• Duality in nonlinear programming
• Duality in quadratic programming
• Duality Theory for Geometric Programming
• Geometric programming: A unified duality theory for quadratically constrained quadratic programs and 𝑙_{𝑝}-constrained 𝑙_{𝑝}-approximation problems
• Geometric Programming: Duality in Quadratic Programming and l_p -Approximation II (Canonical Programs)
• scientific article; zbMATH DE number 3121281 (Why is no real title available?)
• scientific article; zbMATH DE number 3121284 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3363352 (Why is no real title available?)
• scientific article; zbMATH DE number 3366704 (Why is no real title available?)
• scientific article; zbMATH DE number 3069630 (Why is no real title available?)
• scientific article; zbMATH DE number 3084780 (Why is no real title available?)
• Symmetric dual quadratic programs

Cited in

(8)

• On \(\ell_ p\) programming
• A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
• Degenerate quadratic programming and \(\ell_p\) approximation problems
• A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
• Smoothing empirical functions by \(\ell _ p\) programming
• Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems
• A modified reduced gradient method for a class of nondifferentiable problems
• Conic formulation for l_p-norm optimization

This page was built for publication: Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)

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