A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
Mathematical Programming: Series A and B
A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
SIAM Journal on Control and Optimization
Some Noninterior Continuation Methods for LinearComplementarity Problems
SIAM Journal on Matrix Analysis and Applications
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
SIAM Journal on Optimization
SIAM Journal on Optimization
Jacobian Smoothing Methods for Nonlinear Complementarity Problems
SIAM Journal on Optimization
Global convergence of a two-parameter family of conjugate gradient methods without line search
Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
Combination trust-region line-search methods for unconstrained optimization
Combination trust-region line-search methods for unconstrained optimization
Optimality Conditions for Trust-Region Subproblems Involving a Conic Model
SIAM Journal on Optimization
A trust-region method by active-set strategy for general nonlinear optimization
Computers & Mathematics with Applications
A norm descent BFGS method for solving KKT systems of symmetric variational inequality problems
Optimization Methods & Software
A nonmonotone trust-region method of conic model for unconstrained optimization
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
In this paper, a new hybrid method is proposed for solving nonlinear complementarity problems (NCP) with P 0 function. In the new method, we combine a smoothing nonmonotone trust region method based on a conic model and line search techniques. We reformulate the NCP as a system of semismooth equations using the Fischer-Burmeister function. Using Kanzow's smooth approximation function to construct the smooth operator, we propose a smoothing nonmonotone trust region algorithm of a conic model for solving the NCP with P 0 functions. This is different from the classical trust region methods, in that when a trial step is not accepted, the method does not resolve the trust region subproblem but generates an iterative point whose steplength is defined by a line search. We prove that every accumulation point of the sequence generated by the algorithm is a solution of the NCP. Under a nonsingularity condition, the superlinear convergence of the algorithm is established without a strict complementarity condition.