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.002MaRDI QIDQ706949zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Inertia-Controlling Methods for General Quadratic Programming
• scientific article; zbMATH DE number 4072720
• Parallel orthogonal factorization null-space method for dynamic quadratic programming
• An inertial extragradient algorithm for equilibrium and generalized split null point problems
• A direct search quasi-Newton method for nonsmooth unconstrained optimization
• A sparsity preserving convexification procedure for indefinite quadratic programs arising in direct optimal control
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
• An alternating direction numerical method for a class of inverse quadratic programming problems
• A backward error analysis of a null space algorithm in sparse quadratic programming
• scientific article; zbMATH DE number 1383164

Cites work

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

Cited in

(3)

• Inertia-Controlling Methods for General Quadratic Programming
• Constraint deletion strategy in the inertia-controlling quadratic programming method
• Stable reduced Hessian updates for indefinite quadratic programming

This page was built for publication: A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming

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