Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
From MaRDI portal
Publication:6194131
DOI10.1080/02331934.2022.2154606MaRDI QIDQ6194131
Jin-Hua Wang, Lufang Zhang, Xiao Qi Yang, Chong Li
Publication date: 19 March 2024
Published in: Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Error bounds and convergence analysis of feasible descent methods: A general approach
- A multiprojection algorithm using Bregman projections in a product space
- Error bounds in mathematical programming
- On error bounds for lower semicontinuous functions.
- On variable-step relaxed projection algorithm for variational inequalities
- Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces
- Hölder error bounds and Hölder calmness with applications to convex semi-infinite optimization
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
- Solving the split feasibility problem without prior knowledge of matrix norms
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- The multiple-sets split feasibility problem and its applications for inverse problems
- Decoding by Linear Programming
- A relaxed projection method for variational inequalities
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Hölder Metric Subregularity with Applications to Proximal Point Method
- Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Group sparse optimization via $\ell_{p,q}$ regularization
- Convex analysis and monotone operator theory in Hilbert spaces