Inexact smoothing method for large scale minimax optimization (Q425468)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6043895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inexact smoothing method for large scale minimax optimization |
scientific article; zbMATH DE number 6043895 |
Statements
Inexact smoothing method for large scale minimax optimization (English)
0 references
8 June 2012
0 references
nondifferentiable optimization
0 references
minimax problem
0 references
inexact
0 references
maximum entropy
0 references
0 references
0 references
The authors consider the finite minimax optimization problem NEWLINE\[NEWLINE\min_{x\in\mathbb{R}^n}\,F(x),\quad\text{where }F(x)= \max_{j\in 1_m}\,f^j(x).NEWLINE\]NEWLINE For this problem, the authors propose a smoothing method based on a maximum entropy function and an inexact Newton-type algorithm for its solution. The algorithm is shown to both globally and superlinearly convergent.NEWLINENEWLINENumerical results are presented.
0 references
0.8676797151565552
0 references
0.8503851890563965
0 references
0.8459794521331787
0 references
0.8376114964485168
0 references
0.8365869522094727
0 references
