Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909)
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: Quasi-convex feasibility problems: subgradient methods and convergence rates |
scientific article; zbMATH DE number 7478881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quasi-convex feasibility problems: subgradient methods and convergence rates |
scientific article; zbMATH DE number 7478881 |
Statements
Quasi-convex feasibility problems: subgradient methods and convergence rates (English)
0 references
22 February 2022
0 references
global optimization
0 references
quasi-convex feasibility problem
0 references
subgradient method
0 references
iteration complexity
0 references
convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0.8880630135536194
0 references
0.8582710027694702
0 references
0.8404515981674194
0 references
0.838030219078064
0 references
0.832576334476471
0 references
