Now showing items 1-2 of 2
An Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems
For linear programming, a primal-dual interior-point algorithm was recently constructed by Zhang and Tapia that achieves both polynomial complexity and Q-superlinear convergence (Q-quadratic in the nondegenerate case). In ...
A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
The choice of the centering (or barrier) parameter and the step length parameter are the fundamental issues in primal-dual interior-point algorithms for linear programming. Various choices for these two parameters have ...