On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms

DOI10.1007/BF01585769MaRDI QIDQ1890928zbMATH OpenOpenAlexFDO

Authors Yin Zhang, Detong Zhang

Publication date 28 May 1995

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585769

zbMATH Keywords

theoretical convergencepolynomial complexity boundspredictor-corrector primal-dual interior-point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A polynomial predictor-corrector interior-point algorithm for a class convex programming
• Polynomial convergence of a predictor-corrector interior-point algorithm for LCP
• A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Polynomial complexity bounds of Mehrotra-type predictor-corrector algorithms for linear programming over symmetric cones
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
• A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
• On Mehrotra-type predictor-corrector algorithms for convex quadratic programming
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• On the Implementation of a Primal-Dual Interior Point Method
• The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method

Cited in

(55)

• Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
• scientific article; zbMATH DE number 1894985 (Why is no real title available?)
• A Mehrotra-type predictor-corrector algorithm with \(O(\sqrt{n}L)\)-iteration complexity
• An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
• A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
• A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
• An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
• The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Trajectory-following methods for large-scale degenerate convex quadratic programming
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
• Polynomial time second order mehrotra-type predictor--corrector algorithms
• Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
• A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• A new Mehrotra-type predictor-corrector algorithm for linear programming
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
• A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm
• On the convergence of a predictor-corrector variant algorithm
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• A finite termination Mehrotra-type predictor-corrector algorithm
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
• A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
• A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
• A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization
• Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems
• Optimized choice of parameters in interior-point methods for linear programming
• A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
• A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†

This page was built for publication: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890928)