A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P0 LCPs

Authors:
Yun-Bin Zhao;Duan Li
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2002

Citing 0
Cited 4

Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem

Applied Mathematics and Computation
Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

Optimization Methods & Software - Mathematical programming in data mining and machine learning
An entire space polynomial-time algorithm for linear programming

Journal of Global Optimization
A full-Newton step feasible interior-point algorithm for P*(κ)-linear complementarity problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on the concept of the regularized central path, a new non--interior-point path-following algorithm is proposed for solving the P0 linear complementarity problem (P0 LCP). The condition ensuring the global convergence of the algorithm for P0 LCPs is weaker than most conditions previously used in the literature. This condition can be satisfied even when the strict feasibility condition, which has often been assumed in most existing non--interior-point algorithms, fails to hold. When the algorithm is applied to P* and monotone LCPs, the global convergence of this method requires no assumption other than the solvability of the problem. The local superlinear convergence of the algorithm can be achieved under a nondegeneracy assumption. The effectiveness of the algorithm is demonstrated by our numerical experiments.