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