Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee

DOI10.23952/jnva.6.2022.2.03zbMath1493.65108OpenAlexW4312902491MaRDI QIDQ5088832

No author found.

Publication date: 13 July 2022

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.23952/jnva.6.2022.2.03

zbMATH Keywords

subgradient methodconvergence ratesplit feasibility problemiteration complexityquasi-convex optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem
• Random algorithms for convex minimization problems
• Handbook of generalized convexity and generalized monotonicity
• Convergence rates of subgradient methods for quasi-convex optimization problems
• Limiting normal operator in quasiconvex analysis
• A multiprojection algorithm using Bregman projections in a product space
• Error bounds in mathematical programming
• Global error bounds with fractional exponents
• 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
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
• Quasi-convex feasibility problems: subgradient methods and convergence rates
• A family of projection gradient methods for solving the multiple-sets split feasibility problem
• Nonlinear error bounds for quasiconvex inequality systems
• Polyak's gradient method for split feasibility problem constrained by level sets
• Algorithms for the quasiconvex feasibility problem
• Inexact subgradient methods for quasi-convex optimization problems
• Stochastic First-Order Methods with Random Constraint Projection
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• Adaptive subgradient method for the split quasi-convex feasibility problems
• The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• The multiple-sets split feasibility problem and its applications for inverse problems
• A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
• A self-adaptive projection method for solving the multiple-sets split feasibility problem
• Extension of Hoffman’s Error Bound to Polynomial Systems
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Reflection Methods for Inverse Problems with Applications to Protein Conformation Determination
• Optimization Methods for Large-Scale Machine Learning
• On Projection Algorithms for Solving Convex Feasibility Problems
• On Convergence Properties of a Subgradient Method
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Abstract convergence theorem for quasi-convex optimization problems with applications
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Group sparse optimization via $\ell_{p,q}$ regularization
• Convergence and efficiency of subgradient methods for quasiconvex minimization

This page was built for publication: Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee