Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043)
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 6399795
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization |
scientific article; zbMATH DE number 6399795 |
Statements
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (English)
0 references
9 February 2015
0 references
complexity analysis
0 references
interior point algorithm
0 references
non-Lipschitz minimization
0 references
nonconvex minimization
0 references
first-order interior point algorithm
0 references
second-order interior point algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.798960268497467
0 references
0.7920046448707581
0 references
0.7895265221595764
0 references
0.7817873954772949
0 references
