scientific article; zbMATH DE number 1009689

zbMATH Open0874.47029MaRDI QIDQ4336949FDOQ4336949

Authors Heinz H. Bauschke, Jonathan M. Borwein, A. S. Lewis 

Publication date 14 May 1997

zbMATH Keywords

computed tomographyimage reconstructionnonexpansive mappingslinear convergenceconvex feasibility problemselectron microscopymethod of cyclic projectionsangle of a tuple of subspaces

Mathematics Subject Classification ID

Convex programming (90C25) Biomedical imaging and signal processing (92C55) Iterative numerical methods for linear systems (65F10) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convex sets without dimension restrictions (aspects of convex geometry) (52A05)

Recommendations

• Hilbertian convex feasibility problem: Convergence of projection methods
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• A strongly convergent parallel projection algorithm for convex feasibility problem
• Iterations of parallel convex projections in hilbert spaces

Cited In (75)

• Douglas-Rachford splitting and ADMM for pathological convex optimization
• A weak ergodic theorem for infinite products of operators in metric spaces
• Comparing the methods of alternating and simultaneous projections for two subspaces
• Learning from a black box
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• Title not available (Why is no real title available?)
• Polynomial estimates for the method of cyclic projections in Hilbert spaces
• A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
• The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
• Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
• Active-set Methods for Submodular Minimization Problems
• Gearhart-Koshy acceleration for affine subspaces
• Accelerating the convergence of the method of alternating projections
• Ritt operators and convergence in the method of alternating projections
• Convergence of a randomized Douglas-Rachford method for linear system
• Cyclic projection methods on a class of nonconvex sets
• Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
• Cyclic projections in Hadamard spaces
• Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
• Asymptotic behavior of inexact infinite products of nonexpansive mappings in metric spaces
• Generic existence and approximation of fixed points for nonexpansive set-valued maps
• A polynomial rate of asymptotic regularity for compositions of projections in Hilbert space
• Slow convergence of sequences of linear operators. I: Almost arbitrarily slow convergence
• Restricted normal cones and the method of alternating projections: applications
• Restricted normal cones and the method of alternating projections: theory
• Fixed point optimization algorithm and its application to power control in CDMA data networks
• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• Fundamentals of cone regression
• Diagonalization of shift-preserving operators
• Error bounds in mathematical programming
• Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
• Quantitative inconsistent feasibility for averaged mappings
• Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
• A stable convergence theorem for infinite products of nonexpansive mappings in Banach spaces
• Method of successive projections for finding a common point of sets in metric spaces
• The asymptotic behavior of the composition of two resolvents
• Convergence of Krasnoselskii-Mann iterations of nonexpansive operators
• A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
• Projection and proximal point methods: Convergence results and counterexamples.
• Arbitrarily slow convergence of sequences of linear operators: a survey
• An ergodic algorithm for the power-control games for CDMA data networks
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
• An alternating projection that does not converge in norm
• Attracting mappings in Banach and hyperbolic spaces
• The difference vectors for convex sets and a resolution of the geometry conjecture
• The Douglas-Rachford algorithm for two (not necessarily intersecting) affine subspaces
• Stochastic first-order methods with random constraint projection
• A deterministic rescaled perceptron algorithm
• An open question on cyclic relaxation
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• On the linear convergence of circumcentered isometry methods
• Constraint reduction reformulations for projection algorithms with applications to wavelet construction
• Metric subregularity and the proximal point method
• Strong CHIP, normality, and linear regularity of convex sets
• The best approximation theorems and variational inequalities for discontinuous mappings in Banach spaces
• A cyclic Douglas-Rachford iteration scheme
• Cyclic projectors and separation theorems in idempotent convex geometry
• The rate of convergence in the method of alternating projections
• A convergent overlapping domain decomposition method for total variation minimization
• Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• There is no variational characterization of the cycles in the method of periodic projections
• Incremental constraint projection methods for variational inequalities
• The set of divergent infinite products in a Banach space is \(\sigma\)-porous
• Characterizing arbitrarily slow convergence in the method of alternating projections
• How good are projection methods for convex feasibility problems?
• Generalized consistent sampling in abstract Hilbert spaces
• Parallel iterative regularization methods for solving systems of ill-posed equations
• Generic power convergence of order-preserving mappings
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
• On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
• The rate of convergence for the method of alternating projections. II
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• The composition of projections onto closed convex sets in Hilbert space is asymptotically regular

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336949)