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

DOI10.1137/0117031zbMath0172.43704OpenAlexW2034711256MaRDI QIDQ5558782

J. G. Ecker, Elmor L. Peterson

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

Related Items (12)

Controlled dual perturbations for l p -programming ⋮ 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 ⋮ Efficiency in multiple objective optimization problems ⋮ Degenerate quadratic programming and \(\ell_p\) approximation problems ⋮ Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs) ⋮ A modified reduced gradient method for a class of nondifferentiable problems ⋮ Smoothing empirical functions by \(\ell _ p\) programming ⋮ Controlled perturbations for quadratically constrained quadratic programs ⋮ A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications ⋮ On \(\ell_ p\) programming

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