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

From MaRDI portal
Publication:1890928

DOI10.1007/BF01585769zbMath0837.90087OpenAlexW1995535418MaRDI QIDQ1890928

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



Related Items

An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, 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, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, 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 New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization, Improved complexity using higher-order correctors for primal-dual Dikin affine scaling, A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming, Trajectory-following methods for large-scale degenerate convex quadratic programming, Polynomial time second order mehrotra-type predictor--corrector algorithms, 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 new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, 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, Optimized choice of parameters in interior-point methods for linear programming, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization, A Mehrotra predictor-corrector interior-point algorithm for semidefinite optimization, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP(κ)-LCP over symmetric cones, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Solving large-scale linear programs by interior-point methods under the MatlabEnvironment, User'S guide To Lipsol linear-programming interior point solvers V0.4, On the convergence of a predictor-corrector variant algorithm



Cites Work