Iterations of parallel convex projections in hilbert spaces
Numerical Functional Analysis and OptimizationPublished 1 January 1994
Patrick L. Combettes, H. Puh
Citations25
SJR quartileQ2
SJR score0.66
SNIP1.06
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
The problem of finding a common point of closed and convex sets in a Hilbert space is considered. A general iterative method of parallel projections is presented, in which the current iterate is projected simultaneously onto selected sets and the new iterate is a relaxed convex combination of the projections. Weak and strong convergence results are established and the influence of the relaxation coefficients is discussed. Convergence to a least-squares solution when the sets do not intersect is also proved.
Keywords
Computer ScienceMathematics
USSR Computational Mathematics and Mathematical PhysicsThe method of projections for finding the common point of convex sets
732 Citations1967L.G. Gubin, B. T. Polyak +1 more
Various methods of finding points from the intersection of sets, using projection on to a separate set as an elementary operation are considered, and the strong convergence of the sequences obtained is proved.
Nonlinear Functional Analysis and Its Applications
681 Citations1990Eberhard Zeidler
Proceedings of the IEEEThe foundations of set theoretic estimation
635 Citations1993Patrick L. Combettes
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
560 Citations1954Shmuel Agmon
SIAM ReviewRow-Action Methods for Huge and Sparse Systems and Their Applications
480 Citations1981Yair Censor
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
465 Citations1954T. S. Motzkin, I. J. Schoenberg
Elsevier eBooksProjections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory
237 Citations1971Eduardo H. Zarantonello
Numerische MathematikStrong underrelaxation in Kaczmarz's method for inconsistent systems
221 Citations1983Yair Censor, P. P. B. Eggermont +1 more
Mathematics of ComputationOn the approximate minimization of functionals
217 Citations1969James W. Daniel
Linear Algebra and its ApplicationsBlock-iterative projection methods for parallel computation of solutions to convex feasibility problems
173 Citations1989Ron Aharoni, Yair Censor
A block-iterative version of the Agmon-Motzkin-Schoenberg relaxation method for solving systems of linear inequalities is derived and will be useful in various areas of applications, including image reconstruction from projections, image restoration, and other fully discretized inversion problems.
IEEE Transactions on Antennas and PropagationReconfigurable arrays by phase-only control
172 Citations1991O.M. Bucci, Giuseppe Mazzarella +1 more
Journal of Optimization Theory and ApplicationsMethod of successive projections for finding a common point of sets in metric spaces
135 Citations1990Patrick L. Combettes, H.J. Trussell
Numerische MathematikConvergence results for an accelerated nonlinear cimmino algorithm
85 Citations1986Alfredo N. Iusem, Alvaro Rodolfo De Pierro
Linear Algebra and its ApplicationsA simultaneous projections method for linear inequalities
78 Citations1985Alvaro R. De Pierro, Alfredo N. Iusem
Journal of Mathematical Analysis and ApplicationsImage recovery by convex combinations of projections
52 Citations1991G. Crombez
IEEE Transactions on CommunicationsEstimation of the parameters of a multipath channel using set-theoretic deconvolution
52 Citations1992Zoran Kostić, M. Ibrahim Sezan +1 more
Geophysical Research LettersApplications of the POCS inversion method to interpolating topography and other geophysical fields
42 Citations1991William Menke
The author applies the method of Projection Onto Convex Sets (POCS) to the problem of solving geophysical inverse problems and gives examples of using POCS to interpolate topographic profiles, topographic maps, and the physical properties of the earth between well logs.
Journal of Optimization Theory and ApplicationsStrong convergence of projection-like methods in Hilbert spaces
39 Citations1988N. Ottavy
The aim of this paper is to present a unified framework for the study of all the projection-like methods, both parallel and serial, and to establish strong convergence results for quite general sets of constraints.
IEEE Transactions on Circuits and SystemsComputation of discrete Hilbert transform through fast Hartley transform
33 Citations1989Soo‐Chang Pei, Sy-Been Jaw
A fast algorithm is proposed to compute the discrete Hilbert transform via the fast Hartley transform (FHT), where the computation complexity can be greatly reduced from two complex FFTs into two real FHTs.
Lecture notes in medical informaticsContinuous and Semicontinuous Analogues of Iterative Methods of Cimmino and Kaczmarz with Applications to the Inverse Radon Transform
23 Citations1981M. Zuhair Nashed
IEEE Transactions on Circuits and SystemsDesign of a class of time-constrained FIR digital filters by successive projections
17 Citations1989Soo-Chang Pei, Ing-Ing Yang
Journal of Visual Communication and Image RepresentationConvex set theoretic image recovery: History, current status, and new directions
7 Citations1992Patrick L. Combettes
A historical overview of convex set theoretic image recovery is given, its most significant developments are surveyed, its current limitations are analyzed, and new directions for theoretical and applied research are proposed.