An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (Q3603659)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners |
scientific article |
Statements
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners (English)
0 references
18 February 2009
0 references
convex quadratic programming
0 references
iterative linear solver
0 references
primal-dual path-following methods
0 references
interior-point methods
0 references
hybrid augmented normal equation
0 references
inexact search directions
0 references
polynomial convergence
0 references
preconditioning
0 references
conjugate gradient method
0 references
