A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
From MaRDI portal
Publication:4988920
DOI10.3233/FI-2020-1983zbMath1501.90112MaRDI QIDQ4988920
Publication date: 20 May 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- 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 full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- An infeasible full-NT step interior point algorithm for CQSCO
- 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
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A primal-dual infeasible-interior-point algorithm for linear programming
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- 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 Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- 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
- A Predictor-corrector Infeasible-interior-point Algorithm for Semidefinite Optimization in a Wide Neighborhood
- An Arc-search Interior Point Method in the 𝒩−∞ Neighborhood for Symmetric Optimization
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- A Second-order Corrector Infeasible Interior-point Method with One-norm wide Neighborhood for Symmetric Optimization
- 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 New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood