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

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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On Projection Algorithms for Solving Convex Feasibility Problems
The multiple-sets split feasibility problem and its applications for inverse problems
Error bounds in mathematical programming
Approximate solutions of common fixed-point problems
Weak Sharp Minima in Mathematical Programming
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
Handbook of generalized convexity and generalized monotonicity
A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
Inexact subgradient methods for quasi-convex optimization problems
An inexact proximal method for quasiconvex minimization
Random algorithms for convex minimization problems
Convergence and efficiency of subgradient methods for quasiconvex minimization
Random algorithms for solving convex inequalities
Algorithms for the quasiconvex feasibility problem
Successive Averages of Firmly Nonexpansive Mappings
From error bounds to the complexity of first-order descent methods for convex functions
Stochastic first-order methods with random constraint projection
Strong convergence of expected-projection methods in hilbert spaces
On convergence rates of linearized proximal algorithms for convex composite optimization with applications
On Convergence Properties of a Subgradient Method
Linear convergence of CQ algorithms and applications in gene regulatory network inference
Convergence rates of subgradient methods for quasi-convex optimization problems
Optimization Methods for Large-Scale Machine Learning
Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
Limiting normal operator in quasiconvex analysis
Quasi-convex feasibility problems: subgradient methods and convergence rates
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
Finitely convergent iterative methods with overrelaxations revisited

Cited In (4)

Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
On convergence of a stochastic quasigradient algorithm of quantile optimization
Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization
A nonrandom variational approach to stochastic linear quadratic Gaussian optimization involving fractional noises (FLQG)

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

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