A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming

DOI10.1016/j.ejor.2003.04.002zbMath1120.90039OpenAlexW1980537052MaRDI QIDQ706949

Manuel A. Gómez

Publication date: 9 February 2005

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

Full work available at URL: http://hdl.handle.net/2183/29821

zbMATH Keywords

Quadratic programmingInertia-controlling methods

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A numerically stable dual method for solving strictly convex quadratic programs
• Exterior point algorithms for nearest points and convex quadratic programs
• On affine scaling algorithms for nonconvex quadratic programming
• A new penalty function algorithm for convex quadratic programming
• Bound constrained quadratic programming via piecewise quadratic functions
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• A dual-active-set algorithm for positive semi-definite quadratic programming
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• An interior Newton method for quadratic programming
• Constraint deletion strategy in the inertia-controlling quadratic programming method
• A weighted gram-schmidt method for convex quadratic programming
• An Algorithm for Large-Scale Quadratic Programming
• Inertia-Controlling Methods for General Quadratic Programming
• Numerically stable methods for quadratic programming
• A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
• Numerical Optimization
• A New Algorithm for Solving Strictly Convex Quadratic Programs
• On Long Step Path Following and SUMT for Linear and Quadratic Programming
• A General Quadratic Programming Algorithm