Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
From MaRDI portal
Publication:4664041
DOI10.1080/10556780310001604977zbMath1060.90060OpenAlexW1975552883MaRDI QIDQ4664041
Publication date: 5 April 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780310001604977
Related Items
Stochastic block projection algorithms with extrapolation for convex feasibility problems, Characterizations of stability of error bounds for convex inequality constraint systems, From error bounds to the complexity of first-order descent methods for convex functions, 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, Perturbation of error bounds, On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds, A successive centralized circumcentered-reflection method for the convex feasibility problem, Unnamed Item, Convergence properties of dynamic string-averaging projection methods in the presence of perturbations, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Distributed optimization for degenerate loss functions arising from over-parameterization, Metric subregularity and the proximal point method, Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates, Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems, Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
