A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization

DOI10.1007/s11590-020-01573-4zbMath1460.90107OpenAlexW3014503824MaRDI QIDQ2228421

A. Nasrollahi, Behrouz Kheirfam

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01573-4

zbMATH Keywords

predictor-corrector methodslinear optimizationpolynomial complexitywide neighborhoodinfeasible interior-point methods

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
• Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
• A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
• A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
• A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Interior Point Methods for Linear Optimization

This page was built for publication: A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization