supported by the National Natural Science Foundation of China (Grants No.10571134 and 10871144);the Natural Science Foundation of Tianjin (Grant No.07JCYBJC05200)
It is well known that the symmetric cone complementarity problem(SCCP) is a broad class of optimization problems which contains many optimization problems as special cases.Based on a general smoothing function,we pr...
supported by National Natural Science Foundation of China (Grant Nos. 10571134, 10671010);Natural Science Foundation of Tianjin (Grant No. 07JCYBJC05200)
In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally conv...