On the convergence of von Neumann's alternating projection algorithm for two sets

From MaRDI portal

Publication:1308949

Jump to:navigation, search

DOI10.1007/BF01027691zbMath0801.47042OpenAlexW2052059821WikidataQ56935937 ScholiaQ56935937MaRDI QIDQ1308949

Jonathan M. Borwein, Heinz H. Bauschke

Publication date: 6 January 1994

Published in: Set-Valued Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01027691

zbMATH Keywords

multifunctions alternating method open mapping theorem convex feasibility problem Fejér monotonicity convex relations successive projections convex and set-valued analysis angle between two subspaces closed convex nonempty subsets of a Hilbert space convergence of the von Neumann alternating projection algorithm least- squares approximation

Mathematics Subject Classification ID

Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Monotone operators and generalizations (47H05) Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Rate of convergence, degree of approximation (41A25)

Related Items

Necessary conditions for non-intersection of collections of sets, Finding a best approximation pair of points for two polyhedra, Convergence of a randomized Douglas-Rachford method for linear system, Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Local linear convergence for alternating and averaged nonconvex projections, String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Circumcentering approximate reflections for solving the convex feasibility problem, Online distributed design for control cost reduction, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Implicit error bounds for Picard iterations on Hilbert spaces, The rate of convergence for the method of alternating projections. II, Monotonicity and market equilibrium, The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators, Regularity properties of non-negative sparsity sets, On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery, DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS, The difference vectors for convex sets and a resolution of the geometry conjecture, Finding best approximation pairs relative to two closed convex sets in Hilbert spaces, Restricted normal cones and the method of alternating projections: applications, On the clustering of stationary points of Tikhonov's functional for conditionally well-posed inverse problems, The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case, Some new characterizations of intrinsic transversality in Hilbert spaces, The optimal error bound for the method of simultaneous projections, Transversality in variational analysis, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, Alternating projections on nontangential manifolds, Set regularities and feasibility problems, Regularity and stability for a convex feasibility problem, Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic spaces, Maximum entropy and feasibility methods for convex and nonconvex inverse problems, Linear and strong convergence of algorithms involving averaged nonexpansive operators, Peaceman-Rachford splitting for a class of nonconvex optimization problems, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, The block-wise circumcentered-reflection method, Transversality and alternating projections for nonconvex sets, Ubiquitous algorithms in convex optimization generate self-contracted sequences, Low-rank nonnegative tensor approximation via alternating projections and sketching, How good are projection methods for convex feasibility problems?, Iterative methods for solving variational inequalities in Euclidean space, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, AAR-based decomposition algorithm for non-linear convex optimisation, A note on alternating projections in Hilbert space, Emergence of price-taking behavior, Alternating projections in CAT(0) spaces, Projection and proximal point methods: Convergence results and counterexamples., There is no variational characterization of the cycles in the method of periodic projections, Recent results on Douglas-Rachford methods for combinatorial optimization problems, Approximation of fixed points and best proximity points of relatively nonexpansive mappings, A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization, Asymptotic behavior of compositions of under-relaxed nonexpansive operators, The method of alternating relaxed projections for two nonconvex sets, Generalized gradients, bid–ask spreads, and market equilibrium, A variational approach to the alternating projections method, About \([q\)-regularity properties of collections of sets], On biunimodular vectors for unitary matrices, On the existence of minimizers of proximity functions for split feasibility problems, Projection methods for quantum channel construction, Unique reconstruction of band-limited signals by a Mallat-Zhong wavelet transform algorithm, About intrinsic transversality of pairs of sets, Numerical methods for solving some matrix feasibility problems, Characterizing arbitrarily slow convergence in the method of alternating projections, From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation, A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization, Dose-volume-based IMRT fluence optimization: a fast least-squares approach with differentia\-bility, About subtransversality of collections of sets, 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, A cyclic Douglas-Rachford iteration scheme, A new proximal point iteration that converges weakly but not in norm, Quantitative characterizations of regularity properties of collections of sets, Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne, The asymptotic behavior of the composition of two resolvents, Alternating oblique projections for coupled linear systems, Computational acceleration of projection algorithms for the linear best approximation problem, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, Iterative isotonic regression, Approximating the minimum rank of a graph via alternating projection, The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets, On the regularity condition in a convex feasibility problem, Set intersection problems: supporting hyperplanes and quadratic programming, The circumcentered-reflection method achieves better rates than alternating projections, Alternating conditional gradient method for convex feasibility problems, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, Error bounds for the method of simultaneous projections with infinitely many subspaces, A note on the finite convergence of alternating projections, Norm convergence of realistic projection and reflection methods, Finding best approximation pairs for two intersections of closed convex sets, Moduli of regularity and rates of convergence for Fejér monotone sequences, Metric subregularity and the proximal point method, On the finite termination of the Douglas-Rachford method for the convex feasibility problem, Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces, On the rate of convergence of iterated Bregman projections and of the alternating algorithm, The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors, Local linear convergence for inexact alternating projections on nonconvex sets, Iteration process for fixed point problems and zeros of maximal monotone operators, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections, Bilateral exchange and competitive equilibrium, On applications of the calmness moduli for multifunctions to error bounds, Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature, On the centralization of the circumcentered-reflection method, Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency, On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds, Resolvent and proximal compositions, A successive centralized circumcentered-reflection method for the convex feasibility problem, A bicomposition of conical projections, Unnamed Item, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Gradient differences and bilateral barters, Strong CHIP, normality, and linear regularity of convex sets, Ergodic behaviour of a Douglas-Rachford operator away from the origin, Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets, Unnamed Item

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1308949&oldid=13424419"