A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints

Author： Jian Jin-bao

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.31, Iss.3, 2005-07, pp. : 335-361

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 New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems

By Jian Jin-bao

Acta Mathematicae Applicatae Sinica, Vol. 23, Iss. 3, 2007-07 ,pp. : 395-410

Springer Publishing Company

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

Solving mathematical programs with complementarity constraints as nonlinear programs

By Fletcher Roger Leyffer Sven

Optimization Methods and Software, Vol. 19, Iss. 1, 2004-02 ,pp. : 15-40

Taylor & Francis Ltd

Access to resources Recommend Favorite

Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints

By Izmailov A. F. Pogosyan A. L. Solodov M. V.

Optimization Methods and Software, Vol. 26, Iss. 4-5, 2011-10 ,pp. : 847-872

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints

By Huang X. X.

Numerical Functional Analysis and Optimization, Vol. 27, Iss. 1, 2006-01 ,pp. : 71-98

Taylor & Francis Ltd

Access to resources Recommend Favorite