Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
From MaRDI portal
Publication:1633801
DOI10.1186/s13660-018-1641-yzbMath1416.90035OpenAlexW2795964901WikidataQ50323133 ScholiaQ50323133MaRDI QIDQ1633801
Publication date: 20 December 2018
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1641-y
Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (12)
An iterative scheme for testing the positive definiteness of multivariate homogeneous forms ⋮ A linearly convergent algorithm for sparse signal reconstruction ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ Solving the multiple-set split feasibility problem and the equilibrium problem by a new relaxed CQ algorithm ⋮ High-order sum-of-squares structured tensors: theory and applications ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ The conjugate gradient viscosity approximation algorithm for split generalized equilibrium and variational inequality problems ⋮ Mixed simultaneous iterative algorithms for the extended multiple-set split equality common fixed-point problem with Lipschitz quasi-pseudocontractive operators ⋮ An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ An accelerated augmented Lagrangian method for multi-criteria optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
- Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
- A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
- Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- A superlinearly convergent projection method for constrained systems of nonlinear equations
- Z-eigenvalue methods for a global polynomial optimization problem
- Global error bound for the generalized linear complementarity problem over a polyhedral cone
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- A multiprojection algorithm using Bregman projections in a product space
- Generating series of intersection numbers on Hilbert schemes of points
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
- Strong convergence of extragradient method for generalized variational inequalities in Hilbert space
- A new \(CQ\) method for solving split feasibility problem
- A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
- On the mean square value of \(L\)-functions with the weight of quadratic Gauss sums
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- A family of conjugate gradient methods for large-scale nonlinear equations
- A new hybrid power mean involving the generalized quadratic Gauss sums and sums analogous to Kloosterman sums
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
- A simple projection method for solving the multiple-sets split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Convergence analysis of a block improvement method for polynomial optimization over unit spheres
This page was built for publication: Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
