Modified alternating direction methods for the modified multiple-sets split feasibility problems (Q467474): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s10957-013-0502-6 / rank | |||
Property / review text | |||
The authors present three modified alternative direction methods (ADMs) for solving two new multiple-sets split feasibility problem (MSFP) models. The first model is more separable than the original one, which enables one to apply a modified ADM with parallel feature to solve it. Then, to overcome the difficulty of computing projections onto the constraint sets, a special version of this modified method with the strategy of projections onto a half-space is given. The second model consists in finding a least Euclidean norm solution of the MSFP, for which another modified ADM is provided. Comparing it with some algorithms, the efficiency of these methods is shown in preliminary computational tests. These parallel methods are implemented in a personal computer without parallel-architecture. If the methods are implemented in a parallel computer, they may have a higher convergent speed. | |||
Property / review text: The authors present three modified alternative direction methods (ADMs) for solving two new multiple-sets split feasibility problem (MSFP) models. The first model is more separable than the original one, which enables one to apply a modified ADM with parallel feature to solve it. Then, to overcome the difficulty of computing projections onto the constraint sets, a special version of this modified method with the strategy of projections onto a half-space is given. The second model consists in finding a least Euclidean norm solution of the MSFP, for which another modified ADM is provided. Comparing it with some algorithms, the efficiency of these methods is shown in preliminary computational tests. These parallel methods are implemented in a personal computer without parallel-architecture. If the methods are implemented in a parallel computer, they may have a higher convergent speed. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6363604 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiple-sets split feasibility problem | |||
Property / zbMATH Keywords: multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alternating direction method | |||
Property / zbMATH Keywords: alternating direction method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parallel computing | |||
Property / zbMATH Keywords: parallel computing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
half-space projection | |||
Property / zbMATH Keywords: half-space projection / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nada I. Djuranović-Miličić / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-013-0502-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2085660764 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The multiple-sets split feasibility problem and its applications for inverse problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perturbed projections and subgradient projections for the multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-adaptive projection methods for the multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A self-adaptive projection method for solving the multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient simultaneous method for the constrained multiple-sets split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the <i>CQ</i> algorithm for the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The relaxed CQ algorithm solving the split feasibility problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the alternating direction method of multipliers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linearized alternating direction method of multipliers with Gaussian back substitution for separable convex programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved proximal alternating direction method for monotone variational inequalities with separable structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A splitting method for separable convex programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new inexact alternating directions method for monotone variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3161693 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S10957-013-0502-6 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:27, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modified alternating direction methods for the modified multiple-sets split feasibility problems |
scientific article |
Statements
Modified alternating direction methods for the modified multiple-sets split feasibility problems (English)
0 references
3 November 2014
0 references
The authors present three modified alternative direction methods (ADMs) for solving two new multiple-sets split feasibility problem (MSFP) models. The first model is more separable than the original one, which enables one to apply a modified ADM with parallel feature to solve it. Then, to overcome the difficulty of computing projections onto the constraint sets, a special version of this modified method with the strategy of projections onto a half-space is given. The second model consists in finding a least Euclidean norm solution of the MSFP, for which another modified ADM is provided. Comparing it with some algorithms, the efficiency of these methods is shown in preliminary computational tests. These parallel methods are implemented in a personal computer without parallel-architecture. If the methods are implemented in a parallel computer, they may have a higher convergent speed.
0 references
multiple-sets split feasibility problem
0 references
alternating direction method
0 references
parallel computing
0 references
half-space projection
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references