A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy

DOI10.1186/s13660-017-1565-yzbMath1375.90217OpenAlexW2768695648WikidataQ47101910 ScholiaQ47101910MaRDI QIDQ1681807

Yinkui Zhang, Ximei Yang

Publication date: 24 November 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-017-1565-y

zbMATH Keywords

iteration complexityarc-searchinfeasible-interior-point methodsymmetric optimizationMizuno-Todd-Ye predictor-corrector

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints

Cites Work

• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A polynomial arc-search interior-point algorithm for linear programming
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• A new polynomial-time algorithm for linear programming
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
• 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 primal-dual infeasible-interior-point algorithm for linear programming
• Modified predictor-corrector algorithm for locating weighted centers in linear programming
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Extension of primal-dual interior point algorithms to symmetric cones
• On a commutative class of search directions for linear programming over symmetric cones
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
• An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• A Simple Variant of the Mizuno--Todd--Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity
• 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 Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Barrier Functions in Interior Point Methods
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy