The largest step path following algorithm for monotone linear complementarity problems
From MaRDI portal
(Redirected from Publication:1363413)
Recommendations
- Fast convergence of the simplified largest step path following algorithm
- On superlinear and \(O(\sqrt{n}L)\) convergence of a path-following algorithm for monotone linear complementarity problems in a wide neighborhood
- General central path and the largest step general central path following algorithm for linear programming
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 776088 (Why is no real title available?)
- A new polynomial time method for a linear complementarity problem
- A polynomial method of approximate centers for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- Local convergence of interior-point algorithms for degenerate monotone LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Convergence of the Mizuno--Todd--Ye Algorithm to the Analytic Center of the Solution Set
- On the Implementation of a Primal-Dual Interior Point Method
- On the Quadratic Convergence of the Simplified Mizuno--Todd--Ye Algorithm for Linear Programming
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- Path-Following Methods for Linear Programming
- Quadratic Convergence in a Primal-Dual Method
- Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
Cited in
(10)- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Fast convergence of the simplified largest step path following algorithm
- Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- On superlinear and \(O(\sqrt{n}L)\) convergence of a path-following algorithm for monotone linear complementarity problems in a wide neighborhood
- General central path and the largest step general central path following algorithm for linear programming
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
This page was built for publication: The largest step path following algorithm for monotone linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363413)
