Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
DOI10.1007/S10957-006-9095-7zbMATH Open1138.90011OpenAlexW1991452775MaRDI QIDQ995953FDOQ995953
Authors: Tamás Terlaky, Maziar Salahi 
Publication date: 10 September 2007
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-006-9095-7
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
polynomial complexityquadratic convergencepredictor-corrector methodsself-regular proximity functions
Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- 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
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
Cited In (10)
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
- An adaptive-step primal-dual interior point algorithm for linear optimization
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- On self-regular IPMs (with comments and rejoinder)
- Adaptive large neighborhood search for mixed integer programming
- Computational experience with a modified potential reduction algorithm for linear programming
- Interior point methods with self-regular proximities
- A self-regular Newton based algorithm for linear optimization
- 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)
