Dykstra's alternating projection algorithm for two sets
From MaRDI portal
Publication:1340505
DOI10.1006/jath.1994.1136zbMath0833.46011OpenAlexW2004328411WikidataQ56935876 ScholiaQ56935876MaRDI QIDQ1340505
Jonathan M. Borwein, Heinz H. Bauschke
Publication date: 20 March 1996
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jath.1994.1136
Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Convex sets in topological vector spaces (aspects of convex geometry) (52A07)
Related Items
Finding a best approximation pair of points for two polyhedra ⋮ Proximal Splitting Methods in Signal Processing ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ A geometrical approach to iterative isotone regression ⋮ Alternating-projection algorithms for operator-theoretic calculations ⋮ Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings ⋮ The difference vectors for convex sets and a resolution of the geometry conjecture ⋮ Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ Alternating projections on nontangential manifolds ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Variable target value relaxed alternating projection method ⋮ A parameterized Douglas-Rachford algorithm ⋮ A new iterative algorithm for solving a class of matrix nearness problem ⋮ Double inertial proximal gradient algorithms for convex optimization problems and applications ⋮ The asymptotic behavior of the composition of firmly nonexpansive mappings ⋮ Low-rank nonnegative tensor approximation via alternating projections and sketching ⋮ Feature selection algorithm in classification learning using support vector machines ⋮ Convergence Rate Analysis of a Dykstra-Type Projection Algorithm ⋮ A note on alternating projections in Hilbert space ⋮ A Privacy-Preserving Method to Optimize Distributed Resource Allocation ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ There is no variational characterization of the cycles in the method of periodic projections ⋮ Cyclic projection methods on a class of nonconvex sets ⋮ On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ Incomplete alternating projection method for large inconsistent linear systems ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ The forward-backward algorithm and the normal problem ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Proximity for sums of composite functions ⋮ Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ The asymptotic behavior of the composition of two resolvents ⋮ Non-Convex feasibility problems and proximal point methods ⋮ Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ Iterative isotonic regression ⋮ Markov chain lumpability and applications to credit risk modelling in compliance with the International Financial Reporting Standard 9 framework ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ An acceleration scheme for Dykstra's algorithm ⋮ The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint ⋮ ADMM-Based Methods for Nearness SkewSymmetric and Symmetric Solutions of Matrix Equation AXB = C ⋮ Finding best approximation pairs for two intersections of closed convex sets ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Active-set Methods for Submodular Minimization Problems ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ On the convergence of von Neumann's alternating projection algorithm for two sets
