Infeasible interior-point methods for linear optimization based on large neighborhood
From MaRDI portal
Publication:306402
DOI10.1007/s10957-015-0826-5zbMath1346.90567OpenAlexW2104799154WikidataQ59461807 ScholiaQ59461807MaRDI QIDQ306402
Publication date: 31 August 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0826-5
Related Items
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, Relaxing high-dimensional constraints in the direct solution space method for early phase development, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- Convergence of the homotopy path for a full-Newton step infeasible interior-point method
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A combined phase I-phase II projective algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms 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
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- PCx: an interior-point code for linear programming
- LOQO:an interior point code for quadratic programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
