An alternating direction-based contraction method for linearly constrained separable convex programming problems (Q2841146): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:20, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternating direction-based contraction method for linearly constrained separable convex programming problems |
scientific article |
Statements
An alternating direction-based contraction method for linearly constrained separable convex programming problems (English)
0 references
24 July 2013
0 references
alternating direction method
0 references
convex programming
0 references
linear constraint
0 references
separable structure
0 references
contraction method
0 references
