On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
From MaRDI portal
Publication:1890928
DOI10.1007/BF01585769zbMATH Open0837.90087OpenAlexW1995535418MaRDI QIDQ1890928FDOQ1890928
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
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
theoretical convergencepolynomial complexity boundspredictor-corrector primal-dual interior-point algorithm
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)
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
Cited In (55)
- A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones
- 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
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- 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
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- Some disadvantages of a Mehrotra-type primal-dual 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 Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- 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
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- A second-order mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming
- A new Mehrotra-type predictor-corrector algorithm for linear programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- 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
- A constraint-reduced variant of Mehrotra's 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 New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- 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
- 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
- Optimized choice of parameters in interior-point methods for linear programming
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Infeasible Mehrotra-type predictor-corrector interior-point algorithm for the Cartesian \(P_\ast(\kappa)\)-LCP over symmetric cones
- Title not available (Why is that?)
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)
