Convergence rates of subgradient algorithms for convex feasibility problems

DOI10.1007/S00245-026-10515-YMaRDI QIDQ7405674zbMATH OpenFDO

Authors Xiangmei Wang, Yaohua Hu, C. Li, Xiao Qi Yang

Publication date 2026

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00245-026-10515-Y

zbMATH Keywords

bounded error boundbounded regularityconvex feasibility problemsubgradient algorithmsublinear/linear convergence rate

Mathematics Subject Classification ID

Calculus of variations and optimal control; optimization (49-XX)

Cites work

• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
• A family of projection gradient methods for solving the multiple-sets split feasibility problem
• A parallel subgradient projections method for the convex feasibility problem
• A Riemannian variant of the Fletcher-Reeves conjugate gradient method for stochastic inverse eigenvalue problems with partial eigendata
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• A semismooth equation approach to the solution of nonlinear complementarity problems
• Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
• Approximate solutions of common fixed-point problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Convergence analysis under consistent error bounds
• Convergence rate analysis for averaged fixed point iterations in common fixed point problems
• Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property
• Cyclic subgradient projections
• Energy-based sensor network source localization via projection onto convex sets
• Error Bounds for Piecewise Convex Quadratic Programs and Applications
• Error bounds for set inclusions
• Error bounds in mathematical programming
• Global Error Bounds for Convex Inequality Systems in Banach Spaces
• scientific article; zbMATH DE number 6252408 (Why is no real title available?)
• Inverse Eigenvalue Problems
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
• New iterative methods for linear inequalities
• Nonnegative inverse eigenvalue problems with partial eigendata
• On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space
• On convergence rates of linearized proximal algorithms for convex composite optimization with applications
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the Asymptotically Well Behaved Functions and Global Error Bound for Convex Polynomials
• Quasi-convex feasibility problems: subgradient methods and convergence rates
• Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
• The dual normal CHIP and linear regularity for infinite systems of convex sets in Banach spaces
• The method of projections for finding the common point of convex sets
• The multiple-sets split feasibility problem and its applications for inverse problems

This page was built for publication: Convergence rates of subgradient algorithms for convex feasibility problems

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