A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems

DOI10.1016/0377-2217(82)90073-XzbMath0473.90064MaRDI QIDQ1159135

F. Cole, J. G. Ecker, Willy Gochet

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

quadratic constraintsdual algorithmconvex quadratic programsreduced gradient methodnondifferentiable objective functionl-p-constrained l-p-approximation problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Approximations and expansions (41A99)

Related Items (6)

A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming ⋮ Controlled dual perturbations for l p -programming ⋮ Impproving the rate of convergence of the logarithmic barrier function method ⋮ Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints ⋮ Controlled perturbations for quadratically constrained quadratic programs ⋮ Computation of efficient compromise arcs in convex quadratic multicriteria optimization

Cites Work

• Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
• An approach to nonlinear programming
• A modified reduced gradient method for a class of nondifferentiable problems
• A Dual Method for Quadratic Programs with Quadratic Constraints
• Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems