Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
From MaRDI portal
Publication:4717548
DOI10.1137/S105262349427532XzbMath0872.65048MaRDI QIDQ4717548
Publication date: 19 October 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items (7)
Extreme points of well-posed polytopes ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ A condition-based algorithm for solving polyhedral feasibility problems ⋮ Conditioning of linear-quadratic two-stage stochastic optimization problems ⋮ Stability under perturbations of some condition numbers in optimization ⋮ Sign consistent linear programming problems ⋮ Condition measures and properties of the central trajectory of a linear program
This page was built for publication: Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
