Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740)
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: Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization |
scientific article; zbMATH DE number 7220177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization |
scientific article; zbMATH DE number 7220177 |
Statements
Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (English)
0 references
14 July 2020
0 references
convex optimization
0 references
separable convex optimization
0 references
customized proximal point algorithm
0 references
global convergence
0 references
\(\mathcal{O}(1/k)\)-convergence rate
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
