An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming

DOI10.1007/s11590-017-1142-9zbMath1422.90022arXiv1506.06365OpenAlexW3100349759MaRDI QIDQ1653277

Makoto Yamashita, Ya-Guang Yang

Publication date: 3 August 2018

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

Full work available at URL: https://arxiv.org/abs/1506.06365

zbMATH Keywords

linear programmingpolynomial algorithminfeasible-interior-point method

Mathematics Subject Classification ID

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

Related Items (12)

A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ Novel design of morlet wavelet neural network for solving second order Lane-Emden equation ⋮ A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A corrector-predictor arc search interior-point algorithm for symmetric optimization ⋮ An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

Uses Software

• Netlib
• CurveLP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A polynomial arc-search interior-point algorithm for linear programming
• A polynomial arc-search interior-point algorithm for convex quadratic programming
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Polynomial affine algorithms for linear programming
• Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• Mehrotra-type predictor-corrector algorithm revisited
• On Mehrotra-Type Predictor-Corrector Algorithms
• Polynomial algorithms in linear programming
• Feature Article—The Ellipsoid Method: A Survey
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• 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
• Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming