High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600)
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: High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms |
scientific article |
Statements
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (English)
0 references
23 April 2021
0 references
complexity theory
0 references
nonlinear optimization
0 references
non-Lipschitz functions
0 references
partially-separable problems
0 references
group sparsity
0 references
isotropic model
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8716783
0 references
0.87050956
0 references
0.86876714
0 references
0.86837983
0 references
0.86588585
0 references
0.86515844
0 references
0.86443084
0 references
0.86420786
0 references
0.86401784
0 references
