A linearized method for the separable convex programming with objective function represented as three functions (Q2824090)
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 linearized method for the separable convex programming with objective function represented as three functions |
scientific article; zbMATH DE number 6634740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linearized method for the separable convex programming with objective function represented as three functions |
scientific article; zbMATH DE number 6634740 |
Statements
6 October 2016
0 references
linear constraints problems with separable operators
0 references
alternating direction method
0 references
variational inequality
0 references
global convergence
0 references
A linearized method for the separable convex programming with objective function represented as three functions (English)
0 references
