An Asymptotical O(\sqrt{n} L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
DOI10.1137/S1052623494266869zbMATH Open0856.90073OpenAlexW2061981434MaRDI QIDQ4895609FDOQ4895609
Authors: Pi-Fang Hung, Yinyu Ye 
Publication date: 23 February 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494266869
Recommendations
- Neighborhood-following algorithms for linear programming
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
- On extending some wide-neighborhood interior point algorithms from linear programming to linear complementarity problems
- Path-following interior point algorithms based on wide neighborhoods and a new class of directions
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
Numerical mathematical programming methods (65K05) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (20)
- A dynamic large-update primal‐dual interior-point method for linear optimization
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- On self-regular IPMs (with comments and rejoinder)
- Hessian distances and their applications in the complexity analysis of interior-point methods
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Neighborhood-following algorithms for linear programming
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
This page was built for publication: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895609)
