A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A derivative-free approximate gradient sampling algorithm for finite minimax problems |
scientific article; zbMATH DE number 6201602
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A derivative-free approximate gradient sampling algorithm for finite minimax problems |
scientific article; zbMATH DE number 6201602 |
Statements
A derivative-free approximate gradient sampling algorithm for finite minimax problems (English)
0 references
26 August 2013
0 references
derivative-free optimization
0 references
minimax problems
0 references
generalized gradient
0 references
subgradient approximation
0 references
0 references
0 references
0 references
0 references
0 references
0.8595036268234253
0 references
0.8495165109634399
0 references
0.8418867588043213
0 references
0.7992566227912903
0 references
0.7880315184593201
0 references
