Two-step fixed-point proximity algorithms for multi-block separable convex problems (Q2356610)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two-step fixed-point proximity algorithms for multi-block separable convex problems |
scientific article |
Statements
Two-step fixed-point proximity algorithms for multi-block separable convex problems (English)
0 references
6 June 2017
0 references
The authors develop convergent and computationally efficient algorithms for solving multi-block separable convex optimization problems. Moreover, specific two-step fixed-point proximity algorithms from the proposed iterative schemes are derived and their global convergence is established. Numerical experiments demonstrate the numerical efficiency of the proposed algorithms.
0 references
multi-block separable convex optimization problems
0 references
proximity algorithms
0 references
global convergence
0 references
numerical experiment
0 references
0 references
0 references
0 references
0 references
0 references
0 references
