A proximal parallel splitting method for minimizing sum of convex functions with linear constraints (Q2348955)
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: A proximal parallel splitting method for minimizing sum of convex functions with linear constraints |
scientific article; zbMATH DE number 6446318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A proximal parallel splitting method for minimizing sum of convex functions with linear constraints |
scientific article; zbMATH DE number 6446318 |
Statements
A proximal parallel splitting method for minimizing sum of convex functions with linear constraints (English)
0 references
16 June 2015
0 references
parallel splitting method
0 references
proximal point algorithm
0 references
separable structure
0 references
linearized algorithm
0 references
global convergence
0 references
0.8491939902305603
0 references
0.8398407101631165
0 references
0.8378152847290039
0 references
0.8338285088539124
0 references
0.8311397433280945
0 references
