Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649)
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 7121179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary |
scientific article; zbMATH DE number 7121179 |
Statements
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (English)
0 references
22 October 2019
0 references
constrained optimization
0 references
nonconvex programming
0 references
interior point method
0 references
first order algorithm
0 references
nonsmooth problems
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 references
0 references
0 references
0 references
0 references
0 references
0.7516940832138062
0 references
0.7505239248275757
0 references
0.7470653653144836
0 references
