A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems (Q5113714)
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 V U-algorithm for convex finite-max problems |
scientific article; zbMATH DE number 7212396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems |
scientific article; zbMATH DE number 7212396 |
Statements
A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (English)
0 references
16 June 2020
0 references
convex minimization
0 references
derivative-free optimization
0 references
finite-max function
0 references
proximal-point mapping
0 references
\(\mathcal{U}\)-gradient
0 references
\(\mathcal{U}\)-Hessian
0 references
\(\mathcal{V} \mathcal{U}\)-algorithm
0 references
\(\mathcal{V} \mathcal{U}\)-decomposition
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8140830993652344
0 references
0.8040259480476379
0 references
0.7992566227912903
0 references
0.7990695238113403
0 references
