Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers (Q3466914): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (One intermediate revision by the same user not shown) | |||
| label / en | label / en | ||
Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers | |||
| Property / arXiv classification | |||
math.OC | |||
| Property / arXiv classification: math.OC / rank | |||
Normal rank | |||
| Property / arXiv classification | |||
cs.NA | |||
| Property / arXiv classification: cs.NA / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1308.5294 / rank | |||
Normal rank | |||
Latest revision as of 15:59, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers |
scientific article |
Statements
25 January 2016
0 references
alternating direction method of multipliers
0 references
primal splitting
0 references
dual splitting
0 references
convex minimization
0 references
convergence
0 references
principal component analysis
0 references
Gaussian graphical model selection
0 references
numerical result
0 references
math.OC
0 references
cs.NA
0 references
