Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (Q4609466)
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: Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming |
scientific article; zbMATH DE number 6855325
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming |
scientific article; zbMATH DE number 6855325 |
Statements
Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming (English)
0 references
3 April 2018
0 references
block coordinate update (BCU)
0 references
Jacobian rule
0 references
Gauss-Seidel rule
0 references
alternating direction method of multipliers (ADMM)
0 references
