A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:22, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints |
scientific article |
Statements
A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (English)
0 references
25 April 2016
0 references
convex optimization
0 references
separable convex function
0 references
polynomial algorithm
0 references
