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; zbMATH DE number 6573172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time descent method for separable convex optimization problems with linear constraints |
scientific article; zbMATH DE number 6573172 |
Statements
25 April 2016
0 references
convex optimization
0 references
separable convex function
0 references
polynomial algorithm
0 references
0 references
A polynomial-time descent method for separable convex optimization problems with linear constraints (English)
0 references
