An O(\sqrt{n} L)-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
From MaRDI portal
Publication:4018832
Cited in
(16)- Comparative analysis of affine scaling algorithms based on simplifying assumptions
- On lower bound updates in primal potential reduction methods for linear programming
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- A primal-dual potential reduction method for problems involving matrix inequalities
- Dual versus primal-dual interior-point methods for linear and conic programming
- An algorithm to analyze stability of gene-expression patterns
- Smoothed analysis of condition numbers and complexity implications for linear programming
- An O( nL) iteration primal-dual second-order corrector algorithm for linear programming
- Semi-definite programming and quantum information
- Convergence behavior of interior-point algorithms
This page was built for publication: An $O(\sqrt{n} L)$-Iteration Large-Step Primal-Dual Affine Algorithm for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018832)
