Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
From MaRDI portal
Publication:1989949
DOI10.1007/s11075-018-0469-3zbMath1406.90075arXiv1609.00694OpenAlexW3102461863MaRDI QIDQ1989949
Publication date: 29 October 2018
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00694
Related Items
A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints, A polynomial time infeasible interior-point arc-search algorithm for convex optimization, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, On the convergence analysis of arc search interior point methods for LCPs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Computational experience with a primal-dual interior point method for linear programming
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Degeneracy in interior point methods for linear programming: A survey
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- The many facets of linear programming
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Modification of the minimum-degree algorithm by multiple elimination
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
- Globally convergent algorithms for robust pole assignment by state feedback
- Sequential Minimax Search for a Maximum
- Benchmarking optimization software with performance profiles.
