On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms

DOI10.1137/0721072zbMath0578.65061OpenAlexW2018327254MaRDI QIDQ3700718

Andrew R. Conn, Nicholas I. M. Gould

Publication date: 1984

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

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

zbMATH Keywords

Cholesky decompositionLagrangian methodsdirection of infinite feasible descentequality constrained quadratic programnull-space methodsrange-space methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (6)

A note on weakly active constraints in connection with nonconvex quadratic programming ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ On the numerical realization of the exact penalty method for quadratic programming algorithms ⋮ Remarks on second-order conditions in connection with the algorithm of Beale for quadratic programming ⋮ Huber approximation for the non-linear \(l_{1}\) problem ⋮ Constraint deletion strategy in the inertia-controlling quadratic programming method

This page was built for publication: On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms