Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
type: Item
instance of: scholarly article
title: Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
zbMATH Open document ID: 1416.90035
author: Xueyong Wang
published in: Journal of Inequalities and Applications
publication date: 2018-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 94A08
zbMATH DE Number: 6996385
zbMATH Keywords: multiple-sets feasibility problem
zbMATH Keywords: alternating direction method
zbMATH Keywords: penalty method
zbMATH Keywords: convergence
Wikidata QID: Q50323133
MaRDI profile type: Publication
full work available at URL: s13660-018-1641-y
OpenAlex ID: W2795964901
cites work: A multiprojection algorithm using Bregman projections in a product space
cites work: A family of higher-order convergent iterative methods for computing the Moore-Penrose inverse
cites work: Strong convergence of extragradient method for generalized variational inequalities in Hilbert space
cites work: A new hybrid power mean involving the generalized quadratic Gauss sums and sums analogous to Kloosterman sums
cites work: A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
cites work: Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone
cites work: Q4906138
cites work: Q3568359
cites work: Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
cites work: Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs
cites work: A simple projection method for solving the multiple-sets split feasibility problem
cites work: Finite convergence of a projected proximal point algorithm for the generalized variational inequalities
cites work: A family of conjugate gradient methods for large-scale nonlinear equations
cites work: Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
cites work: Global error bound for the generalized linear complementarity problem over a polyhedral cone
cites work: Generating series of intersection numbers on Hilbert schemes of points
cites work: A superlinearly convergent projection method for constrained systems of nonlinear equations
cites work: A smoothing Newton-type method for generalized nonlinear complementarity problem
cites work: On the mean square value of \(L\)-functions with the weight of quadratic Gauss sums
cites work: Z-eigenvalue methods for a global polynomial optimization problem
cites work: Convergence analysis of a block improvement method for polynomial optimization over unit spheres
cites work: Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
cites work: Q5402630
cites work: Iterative oblique projection onto convex sets and the split feasibility problem
cites work: The relaxed CQ algorithm solving the split feasibility problem
cites work: A note on the CQ algorithm for the split feasibility problem
cites work: A new \(CQ\) method for solving split feasibility problem
cites work: Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
cites work: Q5491447
cites work: An efficient simultaneous method for the constrained multiple-sets split feasibility problem
cites work: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
DOI: 10.1186/S13660-018-1641-Y
Recommended article: Modified alternating direction methods for the modified multiple-sets split feasibility problems
Recommended article: A regularized algorithm for the proximal split feasibility problem
Recommended article: Q5380106
Recommended article: Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
Recommended article: New iterative regularization methods for the multiple-sets split feasibility problem
Recommended article: A family of projection gradient methods for solving the multiple-sets split feasibility problem
Recommended article: Q4690495
Recommended article: Q4980494
Recommended article: Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
Recommended article: A proximal point algorithm revisit on the alternating direction method of multipliers
description: scientific article; zbMATH DE number 6996385