A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints (Q2802141)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints |
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
