Method of successive projections for finding a common point of sets in metric spaces

Journal of Optimization Theory and Applications

Volumn 67, Issue 3, 1990, Pages 487-507

  Combettes, P L ^a   Trussell, H J ^b  

^a CITY COLLEGE OF NEW YORK   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

convergence; metric spaces; nonlinear optimization; set valued projections; Successive projections

Indexed keywords

SIGNAL PROCESSING - DIGITAL TECHNIQUES;

HILBERT SPACE; METRIC SPACES; SIGNAL RESTORATION; SUCCESSIVE PROJECTIONS METHOD;

MATHEMATICAL TECHNIQUES;

EID: 0025535641     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/BF00939646     Document Type: Article

References (31)

1. Angenäherte Auflösung von Systemen Linearer Gleichungen
2. Constrained Minimization Methods
3. An Iterative Method for the Extrapolation of Band-Limited Functions
4. Control of Linear Dynamic Systems with Set-Constrained Disturbances
5. Image Restoration by the Method of Convex Projections, Part 1: Theory
6. The Feasible Solution in Signal Restoration
7. Methods for Digital Restoration of Signals Degraded by a Stochastic Impulse Response
8. Tomographic Image Reconstruction from Incomplete View Data by Convex Projections and Direct Fourier Inversion
9. Information Recovery in Missing Angular Data Cases: An Approach by the Convex Projections Method in Three Dimensions
10. The Method of Projections for Finding the Common Point of Convex Sets
11. Strong Convergence of Projection-Like Methods in Hilbert Spaces
12. Approximative Compactness and Chebyshev Sets
13. Some Remarks on Approximative Compactness
14. The Method of Successive Projection for Finding a Common Point of Convex Sets
15. Closest Point Maps and Their Product, II
16. The Product of Projection Operators
17. On Rings of Operators. Reduction Theory
18. Some Remarks on the Measurability of Certain Sets
19. A Big-M Type Method for the Computation of Projections onto Polyhedrons
20. Finding the Nearest Point in a Polytope
21. An Efficient Computational Procedure for a Generalized Quadratic Programming Problems
22. A Survey on the Global Optimization Problem: General Theory and Computational Approaches
23. Stochastic Global Optimization Methods, Part 1: Clustering Methods and Part 2: Multi Level Methods