Solution of monotone complementarity problems with locally Lipschitzian functions

被引:271
作者
Fischer, A
机构
[1] Institute for Numerical Mathematics, Technical University of Dresden
关键词
complementarity problem; locally Lipschitzian function; monotone function; semismooth function; descent method; generalized Newton method; NONLINEAR COMPLEMENTARITY; NEWTON METHOD; NONSMOOTH EQUATIONS; MINIMIZATION PROBLEMS; CONVERGENCE; OPTIMIZATION; ALGORITHM;
D O I
10.1007/BF02614396
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The paper deals with complementarity problems CP(F), where the underlying function F is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equations Phi(x) = 0 or as the problem of minimizing the merit function Psi = 1/2\\Phi\\(2)(2), we extend results which hold for sufficiently smooth functions F to the nonsmooth case. In particular, if F is monotone in a neighbourhood of x, it is proved that 0 is an element of partial derivative Psi(x) is necessary and sufficient for x to be a solution of CP(F). Moreover, for monotone functions F, a simple derivative-free algorithm that reduces Psi is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended to p-order semismooth functions. Under a suitable regularity condition and if F is p-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1 + p.
引用
收藏
页码:513 / 532
页数:20
相关论文
共 51 条
[41]  
QI L, IN PRESS MATH OPERAT
[44]  
Robinson S. M., 1994, Set-Valued Anal., V2, P291, DOI DOI 10.1007/BF01027107
[45]   MATHEMATICAL FOUNDATIONS OF NONSMOOTH EMBEDDING METHODS [J].
ROBINSON, SM .
MATHEMATICAL PROGRAMMING, 1990, 48 (02) :221-229
[46]  
ROCKAFELLAR RT, 1986, MATH PROGRAM STUD, V28, P63, DOI 10.1007/BFb0121126
[47]   COMPUTATIONAL SCHEMES FOR LARGE-SCALE PROBLEMS IN EXTENDED LINEAR-QUADRATIC PROGRAMMING [J].
ROCKAFELLAR, RT .
MATHEMATICAL PROGRAMMING, 1990, 48 (03) :447-474
[48]   GAUSS-NEWTON METHODS FOR THE COMPLEMENTARITY-PROBLEM [J].
SUBRAMANIAN, PK .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1993, 77 (03) :467-482
[49]   Growth behavior of a class of merit functions for the nonlinear complementarity problem [J].
Tseng, P .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1996, 89 (01) :17-37
[50]  
TSENG P, IN PRESS SIAM J OPTI