On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming

DOI10.1137/0612057zbMath0737.65047OpenAlexW2065646793MaRDI QIDQ3980616

Walter Murray, Philip E. Gill, A. L. Forsgren

Publication date: 26 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

optimality conditionsNP-hardnesslocal minimizerinertia-controlling methodquadratic nonconvex programming problem

Mathematics Subject Classification ID

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

Related Items

A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ On the use of a modified Newton method for nonlinear finite element analysis ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Constraint deletion strategy in the inertia-controlling quadratic programming method ⋮ Methods for convex and general quadratic programming