Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
From MaRDI portal
Publication:1421503
DOI10.1016/j.jat.2003.08.004zbMath1045.90045OpenAlexW2148951975MaRDI QIDQ1421503
Yael Zepkowitz-Malachi, Lev M. Bregman, Simeon Reich, Yair Censor
Publication date: 26 January 2004
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2003.08.004
Convex programming (90C25) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Existence theories for problems in abstract spaces (49J27)
Related Items
String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Finding the orthogonal projection of a point onto an affine subspace, A Distributed Boyle--Dykstra--Han Scheme, Construction of best Bregman approximations in reflexive Banach spaces, An acceleration scheme for Dykstra's algorithm, Least-squares estimation of two-ordered monotone regression curves, Set intersection problems: supporting hyperplanes and quadratic programming, Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An iterative procedure for obtaining I-projections onto the intersection of convex sets
- A cyclic projection algorithm via duality
- An iterative row-action method for interval convex programming
- An interior points algorithm for the convex feasibility problem
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- A row-action method for convex programming
- Dykstra's alternating projection algorithm for two sets
- Two generalizations of Dykstra's cyclic projections algorithm
- Primal-dual row-action method for convex programming
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Dual coordinate ascent methods for non-strictly convex minimization
- Dykstras algorithm with bregman projections: A convergence proof
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- An Algorithm for Restricted Least Squares Regression
- Decomposition through formalization in a product space
- A relaxed projection method for variational inequalities
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A Parallel Algorithm for a Class of Convex Programs
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- An Outer Approximation Algorithm for Solving General Convex Programs
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Construction of best Bregman approximations in reflexive Banach spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finding projections onto the intersection of convex sets in hilbert spaces
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Best approximation in inner product spaces
