A polynomial interior-point algorithm with improved iteration bounds for linear optimization

DOI10.1007/S13160-023-00630-6MaRDI QIDQ6498419

Publication date: 7 May 2024

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Decomposition-based interior point methods for stochastic quadratic second-order cone programming
On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
New parameterized kernel functions for linear optimization
A new polynomial-time algorithm for linear programming
A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
A path following method for LCP with superlinearly convergent iteration sequence
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
Interior-point methods
A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
Self-regular functions and new search directions for linear and semidefinite optimization
A full-Newton step feasible interior-point algorithm for $P_\ast(\kappa)$-linear complementarity problems
Interior-point algorithms for $P_{*}(\kappa )$-LCP based on a new class of kernel functions
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
A polynomial-time algorithm for linear optimization based on a new simple kernel function
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
$Q$-superlinear convergence of the iterates in primal-dual interior-point methods

This page was built for publication: A polynomial interior-point algorithm with improved iteration bounds for linear optimization