Convex separable optimization is not much harder than linear optimization (Q5753748)
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 4189477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex separable optimization is not much harder than linear optimization |
scientific article; zbMATH DE number 4189477 |
Statements
Convex separable optimization is not much harder than linear optimization (English)
0 references
1990
0 references
scaling algorithms
0 references
polynomial algorithm
0 references
linear constraints
0 references
polynomial solvability
0 references
proximity results
0 references
nonlinear separable convex objective function
0 references
0.8458526730537415
0 references
0.8458526730537415
0 references
0.8403521180152893
0 references
0.8224576115608215
0 references
0.8137214779853821
0 references
