Geometric Programming: Duality in Quadratic Programming and l_p -Approximation II (Canonical Programs)

DOI10.1137/0117031MaRDI QIDQ5558782zbMATH OpenOpenAlexFDO

Authors Elmor L. Peterson, J. G. Ecker

Publication date 1969

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0117031

zbMATH Keywords

operations research

Cited in

(12)

• 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
• Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
• Extension of Eaves theorem for determining the boundedness of convex quadratic programming problems
• Controlled dual perturbations for l p -programming
• A modified reduced gradient method for a class of nondifferentiable problems
• Efficiency in multiple objective optimization problems
• Controlled perturbations for quadratically constrained quadratic programs
• Conic formulation for l_p-norm optimization

This page was built for publication: Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)

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