Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
From MaRDI portal
(Redirected from Publication:995953)
Recommendations
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- An adaptive self-regular proximity-based large-update IPM for LO
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- Self-regular functions and new search directions for linear and semidefinite optimization
- The complexity of self-regular proximity based infeasible IPMs
Cites work
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- A new polynomial-time algorithm for linear programming
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- An adaptive self-regular proximity-based large-update IPM for LO
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On the Implementation of a Primal-Dual Interior Point Method
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
Cited in
(10)- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- A self-regular Newton based algorithm for linear optimization
- Computational experience with a modified potential reduction algorithm for linear programming
- An adaptive-step primal-dual interior point algorithm for linear optimization
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- On self-regular IPMs (with comments and rejoinder)
- Interior point methods with self-regular proximities
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- Adaptive large neighborhood search for mixed integer programming
- An adaptive long step interior point algorithm for linear optimization
This page was built for publication: Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995953)
