Nonmonotone algorithm for minimax optimization problems (Q632859): Difference between revisions
From MaRDI portal
Latest revision as of 22:33, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonmonotone algorithm for minimax optimization problems |
scientific article |
Statements
Nonmonotone algorithm for minimax optimization problems (English)
0 references
28 March 2011
0 references
The paper deals with finite minimax optimization problems \[ \min_{x\in\mathbb{R}^n}\;\max_{1\leq i\leq m}\, f_i(x), \] where all functions \(f_i\) are twice continuously differentiable. Equivalently, the function \(\Phi(x)= \max f_i(x)\) is to minimize. The problem is not necessarily differentiable, but it is possible to transform the task to a differentiable programming problem with side conditions (inequalities). The authors introduce a nonmonotone algorithm for the construction of a minimizing sequence. The algorithm takes not only the advantage of nonmonotone strategy and second-order step but also the advantages of trust-region methods and line search methods. The new algorithm is of strongly global convergence and superlinear convergence. Numerical experiments (10 examples) indicate the efficiency.
0 references
minimax optimization problem
0 references
algorithm with nonmonotone strategy
0 references
hybrid technique
0 references
second-order correction
0 references
superlinear convergence
0 references
0 references
0 references