A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with *-iteration complexity

Authors:
Florian A. Potra
Affiliations:
Baltimore County
Venue:
Mathematical Programming: Series A and B
Year:
2004

Citing 0
Cited 4

Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

Applied Numerical Mathematics
On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP

SIAM Journal on Optimization
Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems

SIAM Journal on Optimization
A new O(nL) -iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has *-iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.