Convex separable optimization is not much harder than linear optimization (Q5753748): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/96559.96597 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053352956 / rank | |||
Normal rank | |||
Latest revision as of 01:38, 20 March 2024
scientific article; zbMATH DE number 4189477
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
