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

DOI10.1007/S10957-015-0716-XzbMATH Open1327.90226OpenAlexW1982355939MaRDI QIDQ495733FDOQ495733

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

Recommendations

Constructive approximation of solutions to proximal split feasibility problems
On solving proximal split feasibility problems and applications
The multiple-sets split feasibility problem and its applications for inverse problems
Strong convergence result for proximal split feasibility problem in Hilbert spaces
Iterative approximation of solutions for proximal split feasibility problems

zbMATH Keywords

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

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Set-valued operators (47H04) Fixed-point theorems (47H10)

Cites Work

Convex analysis and monotone operator theory in Hilbert spaces
Convex Analysis
A multiprojection algorithm using Bregman projections in a product space
Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
Iterative oblique projection onto convex sets and the split feasibility problem
An elementary proof of convergence for the forward-backward splitting algorithm
Signal Recovery by Proximal Forward-Backward Splitting
On the convergence of von Neumann's alternating projection algorithm for two sets
Title not available (Why is that?)
Monotone Operators and the Proximal Point Algorithm
Solving the split feasibility problem without prior knowledge of matrix norms
Iterative methods for fixed point problems in Hilbert spaces
A unified treatment of some iterative algorithms in signal processing and image reconstruction
The relaxed CQ algorithm solving the split feasibility problem
Restricted normal cones and the method of alternating projections: applications
A dynamical approach to an inertial forward-backward algorithm for convex minimization
Convex analysis and nonlinear optimization. Theory and examples.
A dual condition for the convex subdifferential sum formula with applications
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Dykstra's alternating projection algorithm for two sets
Relaxed Alternating Projection Methods
Fixed points of averages of resolvents: geometry and algorithms
Dualization of signal recovery problems
On the closedness of the algebraic difference of closed convex sets.
Proximity for sums of composite functions
Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
The method of alternating relaxed projections for two nonconvex sets
On the asymptotic behavior of some alternate smoothing series expansion iterative methods
On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems

Cited In (3)

Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
Adaptive subgradient method for the split quasi-convex feasibility problems
Note on the modified relaxation CQ algorithm for the split feasibility problem

This page was built for publication: On the existence of minimizers of proximity functions for split feasibility problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495733)