Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
From MaRDI portal
Publication:6202756
DOI10.1137/23m1545781arXiv2301.03026OpenAlexW4391574861WikidataQ128542404 ScholiaQ128542404MaRDI QIDQ6202756
Publication date: 27 February 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2301.03026
linear convergenceKurdyka-Łojasiewicz propertyDykstra's projection algorithm\(C^{1,\alpha}\)-cone reducibility
Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Modified alternating direction methods for the modified multiple-sets split feasibility problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A coordinate gradient descent method for nonsmooth separable minimization
- A cyclic projection algorithm via duality
- A successive projection method
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Dykstra's alternating projection algorithm for two sets
- A multiprojection algorithm using Bregman projections in a product space
- Two generalizations of Dykstra's cyclic projections algorithm
- Sensitivity analysis of generalized equations
- From error bounds to the complexity of first-order descent methods for convex functions
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Kurdyka-Łojasiewicz exponent via inf-projection
- On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
- Set intersection problems: supporting hyperplanes and quadratic programming
- Dykstras algorithm with bregman projections: A convergence proof
- Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- The multiple-sets split feasibility problem and its applications for inverse problems
- Implicit Functions and Solution Mappings
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Iterative oblique projection onto convex sets and the split feasibility problem
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
- On Projection Algorithms for Solving Convex Feasibility Problems
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Convex Analysis
- The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property
- Convex analysis and monotone operator theory in Hilbert spaces
- Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning
