Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141)
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 7051503
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities |
scientific article; zbMATH DE number 7051503 |
Statements
Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (English)
0 references
7 May 2019
0 references
complexity theory
0 references
non-Lipschitz functions
0 references
partially separable problems
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9129209
0 references
0 references
0.9050769
0 references
0.90469784
0 references
0.90435266
0 references
0.89618045
0 references
0.89600325
0 references
0.8956766
0 references
0.8944185
0 references
