Generalized monotone line search SQP algorithm for constrained minimax problems

ISSN： 0233-1934

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

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

Nonmonotone Line Search Algorithm for Constrained Minimax Problems

By Yu Y.H. Gao L.

Journal of Optimization Theory and Applications, Vol. 115, Iss. 2, 2002-11 ,pp. : 419-446

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

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

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

By Ariyawansa K.A. Jiang P.L.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 2, 2000-11 ,pp. : 223-243

Springer Publishing Company

Access to resources Recommend Favorite

Vector Equilibrium Problems with Generalized Monotone Bifunctions

By Bianchi M. Hadjisavvas N. Schaible S.

Journal of Optimization Theory and Applications, Vol. 92, Iss. 3, 1997-03 ,pp. : 527-542

Springer Publishing Company

Access to resources Recommend Favorite