Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/hilbertian-convex-feasibility-problem-convergence-of-projection-VQK4g0HDUv
References (64)
-
HH Bauschke, JM Borwein, AS Lewis (1996)
To appear in Contemporary Mathematics: Optimization and Nonlinear Analysis -
F. Deutsch (1992)
The Method of Alternating Orthogonal Projections -
Hilbertian Convex Feasibility Problem: Convergence of Projection Methods 329 -
P. Combettes, M. Civanlar (1991)
The foundations of set theoretic estimation[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing
-
P. Tseng (1992)
On the Convergence of the Products of Firmly Nonexpansive MappingsSIAM J. Optim., 2
-
A. Pierro, A. Iusem (1988)
A finitely convergent “row-action” method for the convex feasibility problemApplied Mathematics and Optimization, 17
-
F Deutsch (1992)
Approximation Theory, Spline Functions and Application -
(1960)
On a principle of convergence in Hilbert space -
R. Aharoni, Y. Censor (1989)
Block-iterative projection methods for parallel computation of solutions to convex feasibility problemsLinear Algebra and its Applications, 120
-
(1965)
Generalization of the relaxation method of Motzkin–Agmon -
R Aharoni, Y Censor (1989)
Block-iterative methods for parallel computation of solutions to convex feasibility problemsLinear Algebra Appl, 120
-
P. Combettes, Hong Puh (1994)
Iterations of parallel convex projections in hilbert spacesNumerical Functional Analysis and Optimization, 15
-
EH Zarantonello (1971)
Contributions to Nonlinear Functional Analysis -
(1969)
Méthodes Numériques pour la Résolution desProbì emes d'Optimisation avec Contraintes -
H. Poincaré (1890)
Sur les Equations aux Derivees Partielles de la Physique MathematiqueAmerican Journal of Mathematics, 12
-
J. Neumann (1949)
On Rings of Operators. Reduction TheoryAnnals of Mathematics, 50
-
I Amemiya, T Ando (1965)
Convergence of random products of contractions in Hilbert spaceActa Sci Math (Szeged), 26
-
P. Combettes (1996)
The Convex Feasibility Problem in Image RecoveryAdvances in Imaging and Electron Physics, 95
-
I Halperin (1962)
The product of projection operatorsActa Sci Math (Szeged), 23
-
M. Nashed (1981)
Continuous and Semicontinuous Analogues of Iterative Methods of Cimmino and Kaczmarz with Applications to the Inverse Radon Transform -
E. Zarantonello (1971)
Projections on Convex Sets in Hilbert Space and Spectral Theory: Part I. Projections on Convex Sets: Part II. Spectral Theory -
YI Merzlyakov (1963)
On a relaxation method of solving systems of linear inequalitiesUSSR Comput Math and Math Phys, 2
-
F. Browder (1967)
Convergence theorems for sequences of nonlinear operators in Banach spacesMathematische Zeitschrift, 100
-
(1965)
Closest point maps and their product II -
N. Ottavy (1988)
Strong convergence of projection-like methods in Hilbert spacesJournal of Optimization Theory and Applications, 56
-
S. Reich (1983)
A limit theorem for projectionsLinear & Multilinear Algebra, 13
-
R. Aharoni, A. Berman, Y. Censor (1983)
An interior points algorithm for the convex feasibility problemAdvances in Applied Mathematics, 4
-
(1975)
Méthodes de projections parallèles extrapolées relatives à une intersection de convexes -
Heinz Bauschke, J. Borwein (1996)
On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Rev., 38
-
Y. Censor, A. Lent (1982)
Cyclic subgradient projectionsMathematical Programming, 24
-
LM Brègman (1965)
The method of successive projection for finding a common point of convex setsSoviet Math Dokl, 6
-
(1938)
Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari -
(1937)
Angen ̈ aherte Auflösung von Systemen linearer Gleichungen -
Ronald Bruck (1982)
Random products of contractions in metric and Banach SpacesJournal of Mathematical Analysis and Applications, 88
-
J. Dye (1989)
A generalization of a theorem of Amemiya and Ando on the convergence of random products of contractions in Hilbert spaceIntegral Equations and Operator Theory, 12
-
E. Polak (1990)
Method of Successive Projections for Finding a Common Point of Sets in Metric Spaces -
PL Combettes (1996)
Advances in Imaging and Electron Physics -
Y. Alber, D. Butnariu (1997)
Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach SpacesJournal of Optimization Theory and Applications, 92
-
Halperin I (1962) The product of projection operators -
Heinz Bauschke, J. Borwein, A. Lewis (1997)
The method of cyclic projections for closed convex sets in Hilbert space -
P. Combettes (1993)
Foundation of set theoretic estimation, 81
-
AR Pierro, AN Iusem (1985)
A parallel projection method for finding a common point of a family of convex setsPesqui Oper, 5
-
D. Butnariu, Sjur m (1995)
Strong convergence of expected-projection methods in hilbert spacesNumerical Functional Analysis and Optimization, 16
-
G. Pierra (1984)
Decomposition through formalization in a product spaceMathematical Programming, 28
-
S. Flåm, J. Zowe (1990)
Relaxed outer projections, weighted averages and convex feasibilityBIT, 30
-
J. Dye, S. Reich (1992)
Unrestricted iterations of nonexpansive mappings in Hilbert spaceNonlinear Analysis-theory Methods & Applications, 18
-
P. Combettes (1995)
Construction d'un point fixe commun à une famille de contractions fermes, 320
-
J. Goffin (1980)
The Relaxation Method for Solving Systems of Linear InequalitiesMath. Oper. Res., 5
-
Boris Polyak (1969)
Minimization of unsmooth functionalsUssr Computational Mathematics and Mathematical Physics, 9
-
S. Agmon (1954)
The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 6
-
MZ Nashed (1981)
Lectures Notes in Medical Informatics -
L. Gubin, Boris Polyak, É. Raik (1967)
The method of projections for finding the common point of convex setsUssr Computational Mathematics and Mathematical Physics, 7
-
G. Crombez (1991)
Image Recovery by Convex Combinations of ProjectionsJournal of Mathematical Analysis and Applications, 155
-
(1966)
Convergence of minimizing sequences in conditional extremum problems -
Heinz Bauschke (1995)
A norm convergence result on random products of relaxed projections in Hilbert spaceTransactions of the American Mathematical Society, 347
-
W. Cheney, A. Goldstein (1959)
Proximity maps for convex sets, 10
-
P. Tseng, D. Bertsekas (1987)
Relaxation methods for problems with strictly convex separable costs and linear constraintsMathematical Programming, 38
-
A. Iusem, A. Pierro (1986)
Convergence results for an accelerated nonlinear cimmino algorithmNumerische Mathematik, 49
-
K. Kiwiel (1995)
Block-iterative surrogate projection methods for convex feasibility problemsLinear Algebra and its Applications, 215
-
F. Browder (1958)
On Some Approximation Methods for Solutions of the Dirichlet Problem for Linear Elliptic Equations of Arbitrary OrderIndiana University Mathematics Journal, 7
-
FE Browder (1958)
On some approximation methods for solutions of the Dirichlet problem for linear elliptic equations of arbitrary orderJ Math Mech, 7
-
Y. Censor (1981)
Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSiam Review, 23
-
André Warusfel (1994)
Analyse fonctionnelleMathématiques
-
AN Iusem, L Moledo (1986)
A finitely convergent method of simultaneous subgradient projections for the convex feasibility problemMat Apl Comput, 5
- Publisher
- Springer Journals
- Copyright
- Copyright © 1997 by Springer-Verlag New York Inc.
- Subject
- Mathematics; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization; Mathematical and Computational Physics; Mathematical Methods in Physics; Numerical and Computational Methods
- ISSN
- 0095-4616
- eISSN
- 1432-0606
- DOI
- 10.1007/BF02683333
- Publisher site
- See Article on Publisher Site
Abstract
The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are made on the regularity of the sets and various strategies are considered to control the order in which the sets are selected. Weak and strong convergence results are established within thisbroad framework, which provides a unified view of projection methods for solving hilbertian convex feasibility problems.
Journal
Applied Mathematics and Optimization – Springer Journals
Published: May 1, 1997