Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems

DOI10.3934/dcdss.2021127zbMath1484.65124OpenAlexW3211100337MaRDI QIDQ2129140

Yanyan Li

Publication date: 22 April 2022

Published in: Discrete and Continuous Dynamical Systems. Series S (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/dcdss.2021127

zbMATH Keywords

subgradient methodconvergence theoryquasi-convex programmingrandom controlstochastic feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solutions of common fixed-point problems
• An inexact proximal method for quasiconvex minimization
• 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
• Error bounds in mathematical programming
• From error bounds to the complexity of first-order descent methods for convex functions
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
• Quasi-convex feasibility problems: subgradient methods and convergence rates
• Finitely convergent iterative methods with overrelaxations revisited
• 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
• Weak Sharp Minima in Mathematical Programming
• The multiple-sets split feasibility problem and its applications for inverse problems
• Optimization Methods for Large-Scale Machine Learning
• On Projection Algorithms for Solving Convex Feasibility Problems
• On Convergence Properties of a Subgradient Method
• Strong convergence of expected-projection methods in hilbert spaces
• Successive Averages of Firmly Nonexpansive Mappings
• Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
• Convergence and efficiency of subgradient methods for quasiconvex minimization

This page was built for publication: Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems