A SMOOTHING NEWTON METHOD FOR NCP BASED ON A NEW CLASS OF SMOOTHING FUNCTIONS

Journal of applied mathematics & informatics.
2014.
Jan,
32(1_2):
211-225

- Received : February 08, 2013
- Published : January 30, 2014

Download

PDF

e-PUB

PubReader

PPT

Export by style

Article

Metrics

Cited by

TagCloud

A new class of smoothing functions is introduced in this paper, which includes some important smoothing complementarity functions as its special cases. Based on this new smoothing function, we proposed a smoothing Newton method. Our algorithm needs only to solve one linear system of equations. Without requiring the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Numerical results indicate that the smoothing Newton method based on the new proposed class of smoothing functions with <TEX>${\theta}{\in}(0,1)$</TEX> seems to have better numerical performance than those based on some other important smoothing functions, which also demonstrate that our algorithm is promising.

Citing 'A SMOOTHING NEWTON METHOD FOR NCP BASED ON A NEW CLASS OF SMOOTHING FUNCTIONS
'

@article{ E1MCA9_2014_v32n1_2_211}
,title={A SMOOTHING NEWTON METHOD FOR NCP BASED ON A NEW CLASS OF SMOOTHING FUNCTIONS}
,volume={1_2}
, url={http://dx.doi.org/10.14317/jami}, DOI={10.14317/jami}
, number= {1_2}
, journal={Journal of applied mathematics & informatics}
, publisher={Korean Society of Computational and Applied Mathematics}
, author={Jianguang, Zhu
and
Binbin, Hao}
, year={2014}
, month={Jan}