Summed squared distance error reduction by simultaneous multiprojections and applications
The projections onto convex sets (POCS) algorithms are used for designing or restoring a signal, subject to a (finite) number of constraints that the signal must satisfy. A common version of the POCS algorithm is the serial cycling projection method. In the paper the POCS procedure is extended to encompass situations that could not be treated by conventional procedures. These include the possible nonconvexity of the comstraint sets, the use of projections onto sets with respect to different distance functions, and possible inconsistency of the problem. An algorithm which is a multidistance parallel projection method that generates iterates with a summed squared distance error reduction property, irrespective of the sets being convex or not, irrespective of the number of sets, and allowing multiple distance functions, as well as two application examples, is presented. The proposed method can be applied to a large variety of problems, especially complicated deconvolution-type problems, which are not easily accessible via uni-distance methods.
- A multiprojection algorithm using Bregman projections in a product space
- scientific article; zbMATH DE number 11803
- Iterative projection onto convex sets using multiple Bregman distances
- Image recovery by convex combinations of projections
- Behavior of nonlinear pocs higher order algorithms in the deconvolution problem
- A multiprojection algorithm using Bregman projections in a product space
- A Projection-Based Algorithm for Consistent and Inconsistent Constraints
- Decomposition through formalization in a product space
- scientific article; zbMATH DE number 3924067 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Method of successive projections for finding a common point of sets in metric spaces
- The method of projections for finding the common point of convex sets
- Signal enhancement and the method of successive projections
- Some results on continuous pseudo-contractions in a reflexive Banach space
- Features of application of the consecutive projections method in deconvolution problems
- Approximation of solutions to an equilibrium problem in a nonuniformly smooth Banach space
- On asymptotically strict pseudocontractions and equilibrium problems
- On the strong convergence of an iterative process for asymptotically strict pseudocontractions and equilibrium problems
- REDUCING THE TIME COMPLEXITY AND IDENTIFYING ILL-POSED PROBLEM INSTANCES OF MINKOWSKI SUM BASED SIMILARITY CALCULATIONS
- Signal synthesis in the presence of an inconsistent set of constraints
- On generalized asymptotically quasi--nonexpansive mappings and a Ky Fan inequality
- Behavior of nonlinear pocs higher order algorithms in the deconvolution problem
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- The modified viscosity iteration with \(m\)-generalized hybrid mappings and \((a,b\)-monotone mappings for equilibrium problems
- Inertial self adaptive algorithm for solving equilibrium fixed point and pseudomonotone variational inequality problems in Hilbert spaces
This page was built for publication: Summed squared distance error reduction by simultaneous multiprojections and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1855154)
