On Smoothing Methods for the P0 Matrix Linear Complementarity Problem

Authors:
Xiaojun Chen;Yinyu Ye
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2000

Citing 0
Cited 6

A Smoothing Newton Method for General Nonlinear Complementarity Problems

Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization

Focus on computational neurobiology
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 Asymptotic Approach for Testing P0-Matrices

Electronic Notes in Theoretical Computer Science (ENTCS)
Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a Big-$\Gamma$ smoothing method for solving the P0 matrix linear complementarity problem. We study the trajectory defined by the augmented smoothing equations and global convergence of the method under an assumption that the original P0 matrix linear complementarity problem has a solution. The method has been tested on the P0 matrix linear complementarity problem with unbounded solution set. Preliminary numerical results indicate the robustness of the method.