On the symmetric affiine scaling algorithm for line programming*
From MaRDI portal
Publication:4764582
Recommendations
- A Primal-dual affine scaling algorithm with necessary centering as a safeguard
- scientific article; zbMATH DE number 4197742
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- scientific article; zbMATH DE number 910007
Cites work
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A relaxed version of Karmarkar's method
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
- Superlinear convergence of the affine scaling algorithm
Cited in
(4)
This page was built for publication: On the symmetric affiine scaling algorithm for line programming*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764582)