Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)

DOI10.1016/0022-247X(70)90085-5zbMath0169.22102MaRDI QIDQ2531202

J. G. Ecker, Elmor L. Peterson

Publication date: 1970

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

zbMATH Keywords

operations research

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality and stability in extremum problems involving convex functions
• A Duality Theorem for Convex Programs
• Duality in quadratic programming
• A DUALITY THEOREM IN NON-LINEAR PROGRAMMING WITH NON-LINEAR CONSTRAINTS1
• A duality theorem for non-linear programming
• Symmetric dual quadratic programs
• 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)
• Duality Theory for Geometric Programming
• Duality in nonlinear programming