Now showing items 1-3 of 3
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 ...
On the Convergence of Interior-Point Methods to the Center of the Solution Set in Linear Programming
The notion of the central path plays an important role in the convergence analysis of interior-point methods. Many interior-point algorithms have been developed based on the principle of following the central path, either ...