On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
From MaRDI portal
Publication:4286944
DOI10.1287/MOOR.18.4.964zbMATH Open0810.90091OpenAlexW2014885585MaRDI QIDQ4286944FDOQ4286944
Authors: Shinji Mizuno, Michael J. Todd, Yinyu Ye 
Publication date: 12 April 1994
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8829
Recommendations
- Interior path following primal-dual algorithms. I: Linear programming
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (only showing first 100 items - show all)
- Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
- Smoothed analysis of condition numbers and complexity implications for linear programming
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- Interior-point algorithms for semi-infinite programming
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- Two new predictor-corrector algorithms for second-order cone programming
- Corrector-predictor methods for sufficient linear complementarity problems
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Fast convergence of the simplified largest step path following algorithm
- The largest step path following algorithm for monotone linear complementarity problems
- Mehrotra-type predictor-corrector algorithm revisited
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- On the finite convergence of interior-point algorithms for linear programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- Primal-dual target-following algorithms for linear programming
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Convergence behavior of interior-point algorithms
- Semidefinite programming for discrete optimization and matrix completion problems
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- Degeneracy in interior point methods for linear programming: A survey
- Finding an interior point in the optimal face of linear programs
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model
- A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity
- The curvature integral and the complexity of linear complementarity problems
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- Further development of multiple centrality correctors for interior point methods
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming
- A predictor-corrector algorithm with multiple corrections for convex quadratic programming
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Symmetric primal-dual path-following algorithms for semidefinite programming
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A primal-dual interior point method whose running time depends only on the constraint matrix
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- Long-step strategies in interior-point primal-dual methods
- Computational experience with a modified potential reduction algorithm for linear programming
- Superlinear convergence of interior-point algorithms for semidefinite programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A polynomial arc-search interior-point algorithm for linear programming
- A superquadratic infeasible-interior-point method for linear complementarity problems
- Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Interior-point methods with decomposition for solving large-scale linear programs
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Probabilistic analysis of a differential equation for linear programming
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- Global convergence in infeasible-interior-point algorithms
- The Gaussian hare and the Laplacian tortoise: computability of squared-error versus absolute-error estimators. With comments by Ronald A. Thisted and M. R. Osborne and a rejoinder by the authors
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations
- A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
- Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs
- Constant potential primal-dual algorithms: A framework
- Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
- Title not available (Why is that?)
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
- An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method
- What Tropical Geometry Tells Us about the Complexity of Linear Programming
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Fast quadratic programming for mean-variance portfolio optimisation
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- A new second-order corrector interior-point algorithm for P*(k)-LCP
This page was built for publication: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286944)
