A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints

Author： Zhang J. Z.   Liu G. S.   Wang S. Y.  

Publisher： Springer Publishing Company

ISSN： 0029-599X

Source： Numerische Mathematik, Vol.98, Iss.3, 2004-09, pp. : 539-558

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

Related content

A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS

By  

ANZIAM Journal, Vol. 56, Iss. 3, 2015-01 ,pp. : 299-315

Cambridge University Press

Access to resources Recommend Favorite

Convergence Properties of a Smoothing Approach for Mathematical Programs with Second-Order Cone Complementarity Constraints

By Zhang Yi  

Set-Valued and Variational Analysis, Vol. 19, Iss. 4, 2011-12 ,pp. : 609-646

Springer Publishing Company

Access to resources Recommend Favorite

Regularization method for stochasticmathematical programs with complementarity constraints

By Lin Gui-Hua   Fukushima Masao  

ESAIM: Control, Optimisation and Calculus of Variations, Vol. 11, Iss. 2, 2010-03 ,pp. : 252-265

Edp Sciences

Access to resources Recommend Favorite

A kernel function based Interior-Point Methods for solving ()-linear complementarity problem

By Peyghami M.   Amini Keyvan  

Acta Mathematica Sinica, Vol. 26, Iss. 9, 2010-09 ,pp. : 1761-1778

Springer Publishing Company

Access to resources Recommend Favorite

Comparative studies of the globally convergent convexification algorithm with application to imaging of antipersonnel land mines

By Xin Jianguo   Klibanov Michael  

Applicable Analysis, Vol. 86, Iss. 9, 2007-09 ,pp. : 1147-1176

Taylor & Francis Ltd

Access to resources Recommend Favorite