Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
type: Item
instance of: scholarly article
title: Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
zbMATH Open document ID: 1484.65124
author: Yanyan Li
published in: Discrete and Continuous Dynamical Systems. Series S
publication date: 2022-04-22T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 7512199
zbMATH Keywords: stochastic feasibility problem
zbMATH Keywords: quasi-convex programming
zbMATH Keywords: subgradient method
zbMATH Keywords: random control
zbMATH Keywords: convergence theory
MaRDI profile type: MaRDI publication profile
full work available at URL: dcdss.2021127
OpenAlex ID: W3211100337
cites work: Limiting normal operator in quasiconvex analysis
cites work: On Projection Algorithms for Solving Convex Feasibility Problems
cites work: Q3452586
cites work: Q4257216
cites work: From error bounds to the complexity of first-order descent methods for convex functions
cites work: Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: Weak Sharp Minima in Mathematical Programming
cites work: Strong convergence of expected-projection methods in hilbert spaces
cites work: The multiple-sets split feasibility problem and its applications for inverse problems
cites work: Algorithms for the quasiconvex feasibility problem
cites work: Successive Averages of Firmly Nonexpansive Mappings
cites work: Q4311911
cites work: Q4401741
cites work: Handbook of generalized convexity and generalized monotonicity
cites work: On convergence rates of linearized proximal algorithms for convex composite optimization with applications
cites work: Quasi-convex feasibility problems: subgradient methods and convergence rates
cites work: Convergence rates of subgradient methods for quasi-convex optimization problems
cites work: Inexact subgradient methods for quasi-convex optimization problems
cites work: Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
cites work: A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
cites work: Convergence and efficiency of subgradient methods for quasiconvex minimization
cites work: Finitely convergent iterative methods with overrelaxations revisited
cites work: On Convergence Properties of a Subgradient Method
cites work: Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
cites work: Random algorithms for convex minimization problems
cites work: Error bounds in mathematical programming
cites work: An inexact proximal method for quasiconvex minimization
cites work: Q3028166
cites work: Random algorithms for solving convex inequalities
cites work: Q4368736
cites work: Linear convergence of CQ algorithms and applications in gene regulatory network inference
cites work: Stochastic first-order methods with random constraint projection
cites work: Approximate solutions of common fixed-point problems
DOI: 10.3934/DCDSS.2021127
description: scientific article; zbMATH DE number 7512199