Infeasible interior-point methods for linear optimization based on large neighborhood
From MaRDI portal
Publication:306402
DOI10.1007/S10957-015-0826-5zbMATH Open1346.90567OpenAlexW2104799154WikidataQ59461807 ScholiaQ59461807MaRDI QIDQ306402FDOQ306402
Authors: Alireza Asadi, C. Roos 
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
Recommendations
- An improved infeasible interior-point method with full-Newton step for linear optimization
- An infeasible interior-point algorithm with full-Newton step for linear optimization
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- A new feasible interior-point algorithm with full step for linear optimization based on a simple function
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
Cites Work
- PCx: an interior-point code for linear programming
- LOQO:an interior point code for quadratic programming
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new and efficient large-update interior-point method for linear optimization
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Title not available (Why is that?)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Polynomiality of infeasible-interior-point algorithms for linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- A combined phase I-phase II projective 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
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
- 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
Cited In (4)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function
- 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
Uses Software
This page was built for publication: Infeasible interior-point methods for linear optimization based on large neighborhood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306402)
