Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299)
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: Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach |
scientific article; zbMATH DE number 6345669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach |
scientific article; zbMATH DE number 6345669 |
Statements
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (English)
0 references
18 September 2014
0 references
convex minimization
0 references
saddle-point problem
0 references
proximal point algorithm
0 references
convergence rate
0 references
customized algorithms
0 references
splitting algorithms
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 references
0.8902639150619507
0 references
0.8766923546791077
0 references
0.869694173336029
0 references
0.8423355221748352
0 references
0.8160808086395264
0 references
