A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems

ISSN： 0168-9673

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

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 Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints

By Jian Jin-bao

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

Springer Publishing Company

Access to resources Recommend Favorite

A new non-monotone SQP algorithm for the minimax problem

By Xue Wenjuan

International Journal of Computer Mathematics, Vol. 86, Iss. 7, 2009-07 ,pp. : 1149-1159

Taylor & Francis Ltd

Access to resources Recommend Favorite

Globally and Superlinearly Convergent QP-Free Algorithm for Nonlinear Constrained Optimization

By Qi L. Yang Y.F.

Journal of Optimization Theory and Applications, Vol. 113, Iss. 2, 2002-05 ,pp. : 297-323

Springer Publishing Company

Access to resources Recommend Favorite

Generalized monotone line search SQP algorithm for constrained minimax problems

By Jian Jin-Bao

Optimization, Vol. 58, Iss. 1, 2009-01 ,pp. : 101-131

Taylor & Francis Ltd

Access to resources Recommend Favorite

A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming

By Shen Chungen

International Journal of Computer Mathematics, Vol. 86, Iss. 12, 2009-12 ,pp. : 2201-2217

Taylor & Francis Ltd

Access to resources Recommend Favorite