55
Views
7
CrossRef citations to date
0
Altmetric
Section B

A new non-monotone SQP algorithm for the minimax problem

, &
Pages 1149-1159 | Received 28 Oct 2006, Accepted 15 Oct 2007, Published online: 17 Jun 2009
 

Abstract

In this paper, a new sequential quadratic programming (SQP) algorithm is proposed to solve the minimax problem which uses the idea of nonmonotonicity. The problem is transformed into an equivalent inequality constrained nonlinear optimization problem. In order to prevent the scaling problem, we do some modifications to the minimization problem. By the non-monotone SQP method, the new algorithm is globally convergent without using a penalty function. Furthermore, it is shown that the proposed method does not suffer from the Maratos effect, so the locally superlinear convergence is achieved. Numerical results suggest that our algorithm for solving the minmax problem is efficient and robust.

AMS subject Classification :

Acknowledgements

We are grateful to the Editor and anonymous referees for your useful and detailed comments. This research is supported by the National Science Foundation of China (No. 10571137 and No. 10771162) and the Shanghai Excellent Young Teacher Foundation.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.