Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (Q1706414)
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: Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization |
scientific article; zbMATH DE number 6852053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization |
scientific article; zbMATH DE number 6852053 |
Statements
Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization (English)
0 references
22 March 2018
0 references
The authors confirm that the symmetric alternating direction method of multipliers can also be regularized with an indefinite proximal term. The global convergence is theoretically proved and its worst-case convergence rate in an ergodic sense is established. Numerical experiments are presented.
0 references
convex programming
0 references
alternating direction method
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
