An infeasible-interior-point algorithm using projections onto a convex set
From MaRDI portal
Publication:1915905
DOI10.1007/BF02206811zbMath0848.90087MaRDI QIDQ1915905
Publication date: 1 July 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A little theorem of the big \({\mathcal M}\) in interior point algorithms
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A primal-dual infeasible-interior-point algorithm for linear programming
- Superlinear convergence of infeasible-interior-point methods for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
