An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming (Q5470255): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: PDNET / rank | |||
Normal rank |
Revision as of 22:15, 28 February 2024
scientific article; zbMATH DE number 5029031
Language | Label | Description | Also known as |
---|---|---|---|
English | An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming |
scientific article; zbMATH DE number 5029031 |
Statements
An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming (English)
0 references
30 May 2006
0 references
convex quadratic programming
0 references
iterative linear solver
0 references
maximum weight basis preconditioner
0 references
primal-dual path-following methods
0 references
interior-point methods
0 references
augmented normal equation
0 references
inexact search directions
0 references
polynomial convergence
0 references
quadratic programming
0 references
primal-dual
0 references
path-following iterative linear solver
0 references