A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
From MaRDI portal
Publication:706949
DOI10.1016/J.EJOR.2003.04.002zbMATH Open1120.90039OpenAlexW1980537052MaRDI QIDQ706949FDOQ706949
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
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
- Numerically stable methods for quadratic programming
- Numerical Optimization
- A General Quadratic Programming Algorithm
- A numerically stable dual method for solving strictly convex quadratic programs
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A dual-active-set algorithm for positive semi-definite quadratic programming
- A weighted gram-schmidt method for convex quadratic programming
- An Algorithm for Large-Scale Quadratic Programming
- Inertia-Controlling Methods for General Quadratic Programming
- Title not available (Why is that?)
- An interior Newton method for quadratic programming
- On affine scaling algorithms for nonconvex quadratic programming
- Exterior point algorithms for nearest points and convex quadratic programs
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- A new penalty function algorithm for convex quadratic programming
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Bound constrained quadratic programming via piecewise quadratic functions
- Constraint deletion strategy in the inertia-controlling quadratic programming method
- A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
- On Long Step Path Following and SUMT for Linear and Quadratic Programming
Cited In (3)
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)
