New Relaxation Method for Mathematical Programs with Complementarity Constraints

ISSN： 0022-3239

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

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

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

Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints

By Izmailov A.

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 199-221

Springer Publishing Company

Access to resources Recommend Favorite

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

Global Convergence of a Smooth Approximation Method for Mathematical Programs with Complementarity Constraints

By Yin Hongxia

Mathematical Methods of Operations Research, Vol. 64, Iss. 2, 2006-10 ,pp. : 255-269

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