An Asymptotical O(\sqrt{n} L)-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
From MaRDI portal
Publication:4895609
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
Cited in
(20)- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- On self-regular IPMs (with comments and rejoinder)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints
- A primal-dual interior-point algorithm with arc-search for semidefinite programming
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Neighborhood-following algorithms for linear programming
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming
- A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization
- A dynamic large-update primal‐dual interior-point method for linear optimization
- Hessian distances and their applications in the complexity analysis of interior-point methods
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- A polynomial interior-point algorithm with improved iteration bounds for linear optimization
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- 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
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)
