On the existence of minimizers of proximity functions for split feasibility problems

DOI10.1007/s10957-015-0716-xzbMath1327.90226MaRDI QIDQ495733

Publication date: 15 September 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0716-x

zbMATH Keywords

proximity function; split feasibility problem; proximal point method; \(CQ\)-algorithm; Fenchel-Rockafellar's duality

Mathematics Subject Classification ID

90C25: Convex programming

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

47H10: Fixed-point theorems

47H04: Set-valued operators

Related Items

Note on the modified relaxation CQ algorithm for the split feasibility problem, Adaptive subgradient method for the split quasi-convex feasibility problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Restricted normal cones and the method of alternating projections: applications
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Iterative methods for fixed point problems in Hilbert spaces
The method of alternating relaxed projections for two nonconvex sets
Proximity for sums of composite functions
Dualization of signal recovery problems
Convex analysis and nonlinear optimization. Theory and examples.
On the convergence of von Neumann's alternating projection algorithm for two sets
Dykstra's alternating projection algorithm for two sets
A multiprojection algorithm using Bregman projections in a product space
On the closedness of the algebraic difference of closed convex sets.
On the asymptotic behavior of some alternate smoothing series expansion iterative methods
Fixed Points of Averages of Resolvents: Geometry and Algorithms
Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
Solving the split feasibility problem without prior knowledge of matrix norms
Relaxed Alternating Projection Methods
Monotone Operators and the Proximal Point Algorithm
A unified treatment of some iterative algorithms in signal processing and image reconstruction
Iterative oblique projection onto convex sets and the split feasibility problem
The relaxed CQ algorithm solving the split feasibility problem
A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
Signal Recovery by Proximal Forward-Backward Splitting
Convex Analysis
Convex analysis and monotone operator theory in Hilbert spaces
Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization