Stochastic quasi-subgradient methods with Bregman projection for stochastic quasi-convex feasibility problems

Read full text Summarise with VIRAT
Cited by: 0
References: 32

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

The feasibility problem lies at the core of modeling numerous challenges across mathematics and the physical sciences.Quasi-convex functions, widely applied in economics, finance, and management science, offer a flexible framework for such problems.This paper addresses the stochastic quasi-convex feasibility problem (SQFP), which seeks a common point within infinitely many sublevel sets of quasi-convex functions.Inspired by the idea of a stochastic index scheme and Bregman projection, we propose a stochastic quasi-subgradient method with Bregman projection to solve the SQFP, in which the quasi-subgradients of a random (and finite) index set of component quasi-convex functions at the current iterate are used to construct the descent direction and employ the Bregman projection in place of the Euclidean projection at each iteration.Furthermore, we introduce a notion of Hölder-type bounded error bound property relative to the Bregman projection and random control sequence for the SQFP.Leveraging this property, we establish a global convergence theorem and quantify convergence rates for the proposed algorithm.This paper reveals that the stochastic quasi-subgradient method with Bregman projection offers both low computational cost requirement and fast convergence feature.

Fields of Study & Subjects

Optimization and Variational Analysis Stochastic Gradient Optimization Techniques Sparse and Compressive Sensing Techniques

Publication details

Journal / source
Journal of Nonlinear and Variational Analysis
Volume
10
Issue
3
Publication date
28 March 2026
Language
EN