Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning (Q2353007)
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: Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning |
scientific article |
Statements
Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning (English)
0 references
7 July 2015
0 references
convex programs
0 references
alternating direction method
0 references
linearized alternating direction method
0 references
proximal alternating direction method
0 references
parallel splitting
0 references
adaptive renalty
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8292914628982544
0 references
0.8265407681465149
0 references
0.8205713629722595
0 references
0.8084008693695068
0 references
0.8012097477912903
0 references