Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-18T13:20:02.967Z Has data issue: false hasContentIssue false

Generalised monotone line search algorithm for degenerate nonlinear minimax problems

Published online by Cambridge University Press:  17 April 2009

Jin-Bao Jian
Affiliation:
College of Mathematics and Informatics Science, Guangxi University, 530004, Nanning, Peoples Republic of China, e-mail: jianjb@gxu.edu.cn
Ran Quan
Affiliation:
College of Mathematics and Informatics Science, Guangxi University, 530004, Nanning, Peoples Republic of China, e-mail: jianjb@gxu.edu.cn
Xue-Lu Zhang
Affiliation:
College of Mathematics and Informatics Science, Guangxi University, 530004, Nanning, Peoples Republic of China, e-mail: jianjb@gxu.edu.cn
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper, nonlinear minimax problems are discussed. Using Sequential Quadratic Programming and the generalised monotone line search technique, we propose a new algorithm for solving degenerate minimax problems. At each iteration of the proposed algorithm, a search direction is obtained by solving a new Quadratic Programming problem which always has a solution. Global convergence can be obtained without the regularity condition of linear independence. Finally, some numerical experiments are reported.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2006