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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners |
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
0.9290848
0 references
0.83033144
0 references
0.8120831
0 references
0 references
0.7958781
0 references
0.78485876
0 references
0.78290975
0 references
0.7813409
0 references
