Extrapolation algorithm for affine-convex feasibility problems

DOI10.1007/s11075-005-9010-6zbMath1098.65060OpenAlexW2067877923MaRDI QIDQ2494384

Patrick L. Combettes, Serge G. Kruk, Heinz H. Bauschke

Publication date: 26 June 2006

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-005-9010-6

zbMATH Keywords

convergencenumerical resultsHilbert spaceconvex setsprojection methodextrapolationconvex feasibility problemaffinite sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Programming in abstract spaces (90C48) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items

Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems, Accelerated reflection projection algorithm and its application to the LMI problem, Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces, Stochastic block projection algorithms with extrapolation for convex feasibility problems, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, Variable target value relaxed alternating projection method, A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, How good are projection methods for convex feasibility problems?, Variance reduction for root-finding problems, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, How good are extrapolated bi-projection methods for linear feasibility problems?, An extrapolated iterative algorithm for multiple-set split feasibility problem, Linear convergence rates for extrapolated fixed point algorithms, Incremental proximal methods for large scale convex optimization, Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Numerical methods for solving some matrix feasibility problems, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Functions with prescribed best linear approximations, An acceleration scheme for Dykstra's algorithm, Faster Randomized Block Kaczmarz Algorithms, Reconstruction of functions from prescribed proximal points, Set intersection problems: supporting hyperplanes and quadratic programming, Unnamed Item, Convergence of string-averaging method for a class of operators, Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates, The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem, On a fast deterministic block Kaczmarz method for solving large-scale linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbertian convex feasibility problem: Convergence of projection methods
• Reflection-projection method for convex feasibility problems with an obtuse cone
• Relaxed outer projections, weighted averages and convex feasibility
• Strong convergence of projection-like methods in Hilbert spaces
• A parallel subgradient projections method for the convex feasibility problem
• Incomplete projection algorithms for solving the convex feasibility problem
• Block-iterative surrogate projection methods for convex feasibility problems
• A remark on vector-valued equilibria and generalized monotonicity
• Variational methods in partially ordered spaces
• Image recovery by convex combinations of projections
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• A limit theorem for projections
• Decomposition through formalization in a product space
• Cyclic subgradient projections
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Monotone Operators and the Proximal Point Algorithm
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• Accelerating the convergence of the method of alternating projections
• Fast image recovery using dynamic load balancing in parallel architectures, by means of incomplete projections
• Solving monotone inclusions via compositions of nonexpansive averaged operators
• Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
• On Projection Algorithms for Solving Convex Feasibility Problems
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
• The method of projections for finding the common point of convex sets
• Minimization of unsmooth functionals
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• On a relaxation method of solving systems of linear inequalities
• Best approximation in inner product spaces
• Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000