Loss and retention of accuracy in affine scaling methods

DOI10.1080/10556780108805814zbMath1099.90592OpenAlexW2077191203MaRDI QIDQ2778681

Achiya Dax

Publication date: 2001

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Interior-point methods (90C51)

Related Items (3)

A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting ⋮ The \(\ell_1\) solution of linear inequalities ⋮ The distance between two convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• The affine-scaling direction for linear programming is a limit of projective-scaling directions
• Computing projections for the Karmarkar algorithm
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Global convergence of the affine scaling methods for degenerate linear programming problems
• On the convergence of the affine-scaling algorithm
• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
• Affine-scaling for linear programs with free variables
• Stability analysis of the method of seminormal equations for linear least squares problems
• An implementation of Karmarkar's algorithm for linear programming
• A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting
• Numerical methods for solving linear least squares problems
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Affine Scaling Algorithm Fails for Stepsize 0.999
• Computer-Intensive Methods in Statistical Regression
• The $l_1 $ Solution of Linear Equations Subject to Linear Constraints
• The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
• Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
• A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP

This page was built for publication: Loss and retention of accuracy in affine scaling methods