A wide neighborhood infeasible-interior-point method with arc-search for linear programming
From MaRDI portal
Publication:295450
DOI10.1007/s12190-015-0900-zzbMath1338.90248MaRDI QIDQ295450
Ximei Yang, Yinkui Zhang, Hong-Wei Liu
Publication date: 13 June 2016
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-015-0900-z
Related Items
A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path, A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, On the extension of an arc-search interior-point algorithm for semidefinite optimization, An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood, An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming, An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
Uses Software
Cites Work
- Unnamed Item
- A polynomial arc-search interior-point algorithm for linear programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Long-step strategies in interior-point primal-dual methods
- Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Neighborhood-following algorithms for linear programming
- An entire space polynomial-time algorithm for linear programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Interior Point Methods for Linear Optimization
