Method of successive projections for finding a common point of sets in metric spaces
From MaRDI portal
Publication:911469
DOI10.1007/BF00939646zbMath0696.90052MaRDI QIDQ911469
Patrick L. Combettes, H. Joel Trussell
Publication date: 1990
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Metric spaces, metrizability (54E35) Programming in abstract spaces (90C48) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (30)
On local convergence of the method of alternating projections ⋮ A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces ⋮ Alternating projection, ptychographic imaging and phase synchronization ⋮ Generalized pole placement via static output feedback: a methodology based on projections ⋮ Some convergence strategies for the alternating generalized projection method ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ Alternating convex projection methods for discrete-time covariance control design ⋮ Iterations of parallel convex projections in hilbert spaces ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ Low-order control design for LMI problems using alternating projection methods ⋮ Alternating projections on nontangential manifolds ⋮ Strong convergence of alternating projections ⋮ Restricted normal cones and sparsity optimization with affine constraints ⋮ Image decoding optimization based on compressive sensing ⋮ Cyclic projection methods on a class of nonconvex sets ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Signal enhancement and the method of successive projections ⋮ The method of alternating relaxed projections for two nonconvex sets ⋮ Optimal estimation theory for dynamic systems with set membership uncertainty: An overview ⋮ On biunimodular vectors for unitary matrices ⋮ Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases ⋮ Induced \(\mathfrak{L}_ 2\) norm model reduction of polytopic uncertain linear systems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Prox-regularity of rank constraint sets and implications for algorithms ⋮ Duality and Convex Programming ⋮ Design of the best linear classifier for box-constrained data sets ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors ⋮ Summed squared distance error reduction by simultaneous multiprojections and applications
Cites Work
- A big-M type method for the computation of projections onto polyhedrons
- Strong convergence of projection-like methods in Hilbert spaces
- An iterative method for the extrapolation of band-limited functions
- On rings of operators. Reduction theory
- Stochastic global optimization methods part I: Clustering methods
- Digital image restoration: A survey
- Finding the nearest point in A polytope
- An Efficient Computational Procedure for a Generalized Quadratic Programming Problem
- The method of projections for finding the common point of convex sets
- Some remarks on the measurability of certain sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Method of successive projections for finding a common point of sets in metric spaces
