A Primal-dual affine scaling algorithm with necessary centering as a safeguard
From MaRDI portal
(Redirected from Publication:4351192)
Recommendations
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- A Low Complexity Interior-Point Algorithm for Linear Programming
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- On the symmetric affiine scaling algorithm for line programming*
- Interior path following primal-dual algorithms. I: Linear programming
Cites work
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- An implementation of Karmarkar's algorithm for linear programming
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Cited in
(6)- A weighted least squares study of robustness in interior point linear programming
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
- scientific article; zbMATH DE number 1383187 (Why is no real title available?)
- On the symmetric affiine scaling algorithm for line programming*
This page was built for publication: A Primal-dual affine scaling algorithm with necessary centering as a safeguard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351192)
