A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints

Author： Chen Xiaojun   Fukushima Masao  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.3, 2004-03, pp. : 223-246

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Smoothing method for mathematical programs with symmetric cone complementarity constraints

By Yan Tao  

Optimization, Vol. 60, Iss. 1-2, 2011-01 ,pp. : 113-128

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Robust SQP Method for Mathematical Programs with Linear Complementarity Constraints

By Liu Xinwei   Perakis Georgia   Sun Jie  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 5-33

Springer Publishing Company

Access to resources Recommend Favorite

Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints

By Thoai N.   Yamamoto Y.   Yoshise A.  

Journal of Optimization Theory and Applications, Vol. 124, Iss. 2, 2005-02 ,pp. : 467-490

Springer Publishing Company

Access to resources Recommend Favorite

A continuation method for linear complementarity problems with P 0 matrix

By Li Meiyan   Ma Changfeng  

Optimization, Vol. 63, Iss. 5, 2014-05 ,pp. : 757-773

Taylor & Francis Ltd

Access to resources Recommend Favorite

New Relaxation Method for Mathematical Programs with Complementarity Constraints

By Lin G.H.   Fukushima M.  

Journal of Optimization Theory and Applications, Vol. 118, Iss. 1, 2003-07 ,pp. : 81-116

Springer Publishing Company

Access to resources Recommend Favorite