A partially proximal S-ADMM for separable convex optimization with linear constraints (Q2227678)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7310763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A partially proximal S-ADMM for separable convex optimization with linear constraints |
scientific article; zbMATH DE number 7310763 |
Statements
A partially proximal S-ADMM for separable convex optimization with linear constraints (English)
0 references
15 February 2021
0 references
separable convex optimization
0 references
multiple blocks
0 references
symmetric alternating direction method of multipliers
0 references
proximal point algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8942275643348694
0 references
0.8676525950431824
0 references
0.8396834135055542
0 references
0.8381010890007019
0 references
