An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners

DOI10.1080/10556780802414049zbMath1172.65030OpenAlexW2117753887MaRDI QIDQ3603659

J. O'Neal, Renato D. C. Monteiro, Zhaosong Lu

Publication date: 18 February 2009

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780802414049

zbMATH Keywords

preconditioning conjugate gradient method polynomial convergence interior-point methods convex quadratic programming primal-dual path-following methods iterative linear solver inexact search directions hybrid augmented normal equation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Uses Software

This page was built for publication: An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners