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

DOI10.1137/0612057MaRDI QIDQ3980616zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A note on weakly active constraints in connection with nonconvex quadratic programming
• Inertia-Controlling Methods for General Quadratic Programming
• On the numerical realization of the exact penalty method for quadratic programming algorithms
• Local minimizer of a nonconvex quadratic programming problem

Cited in

(7)

• 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
• Local minimizer of a nonconvex quadratic programming problem
• A solver for nonconvex bound-constrained quadratic optimization
• Methods for convex and general quadratic programming
• On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods

This page was built for publication: On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming

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