A family of NCP functions and a descent method for the nonlinear complementarity problem

Jein-Shan Chen Shaohua Pan

Optimization and Control mathscidoc:1910.43872

Computational Optimization and Applications, 40, (3), 389-404, 2008.7
In last decades, there has been much effort on the solution and the analysis of the nonlinear complementarity problem (NCP) by reformulating NCP as an unconstrained minimization involving an NCP function. In this paper, we propose a family of new NCP functions, which include the Fischer-Burmeister function as a special case, based on a <i>p</i>-norm with <i>p</i> being any fixed real number in the interval (1,+), and show several favorable properties of the proposed functions. In addition, we also propose a descent algorithm that is indeed derivative-free for solving the unconstrained minimization based on the merit functions from the proposed NCP functions. Numerical results for the test problems from MCPLIB indicate that the descent algorithm has better performance when the parameter <i>p</i> decreases in (1,+). This implies that the merit functions associated with <i>p</i>(1,2), for example <i>p</i>=1.5, are more effective
No keywords uploaded!
[ Download ] [ 2019-10-20 22:31:53 uploaded by Jein_Shan_Chen ] [ 145 downloads ] [ 0 comments ]
@inproceedings{jein-shan2008a,
  title={A family of NCP functions and a descent method for the nonlinear complementarity problem},
  author={Jein-Shan Chen, and Shaohua Pan},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020223153161500401},
  booktitle={Computational Optimization and Applications},
  volume={40},
  number={3},
  pages={389-404},
  year={2008},
}
Jein-Shan Chen, and Shaohua Pan. A family of NCP functions and a descent method for the nonlinear complementarity problem. 2008. Vol. 40. In Computational Optimization and Applications. pp.389-404. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20191020223153161500401.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved