A modified SQP algorithm for minimax problems (Q837129): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jmaa.2009.06.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981981610 / rank | |||
Normal rank |
Revision as of 19:49, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A modified SQP algorithm for minimax problems |
scientific article |
Statements
A modified SQP algorithm for minimax problems (English)
0 references
10 September 2009
0 references
This paper deals with nonlinear minimax problems and a Sequential Quadratic Programming (SQP) method. In this paper, the authors propose a modified nonmonotone line search SQP algorithm for nonlinear minimax problems. During each iteration of the proposed algorithm, a main search direction is obtained by solving a reduced quadratic program (QP). In order to avoid the Maratos effect, a correction direction is generated by solving the reduced system of linear equations. Under mild conditions, the global and superlinear convergence can be achieved. Preliminary numerical results show that the proposed algorithm may be effective.
0 references
nonmonotone line search
0 references
quadratic program
0 references
global convergence
0 references
Maratos effect
0 references
superlinear convergence
0 references