Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
From MaRDI portal
Publication:2129140
Recommendations
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Stochastic subgradient method for quasi-convex optimization problems
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Algorithms for the quasiconvex feasibility problem
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1321699 (Why is no real title available?)
- scientific article; zbMATH DE number 679864 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 3435272 (Why is no real title available?)
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Algorithms for the quasiconvex feasibility problem
- An inexact proximal method for quasiconvex minimization
- Analysis of the convergence rate for the cyclic projection algorithm applied to basic semialgebraic convex sets
- Approximate solutions of common fixed-point problems
- Convergence and efficiency of subgradient methods for quasiconvex minimization
- Convergence rates of subgradient methods for quasi-convex optimization problems
- Convex optimization algorithms
- Error bounds in mathematical programming
- Finitely convergent iterative methods with overrelaxations revisited
- From error bounds to the complexity of first-order descent methods for convex functions
- Handbook of generalized convexity and generalized monotonicity
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Inexact subgradient methods for quasi-convex optimization problems
- Limiting normal operator in quasiconvex analysis
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- On Convergence Properties of a Subgradient Method
- On Projection Algorithms for Solving Convex Feasibility Problems
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Optimization methods for large-scale machine learning
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Random algorithms for convex minimization problems
- Random algorithms for solving convex inequalities
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Stochastic first-order methods with random constraint projection
- Strong convergence of expected-projection methods in hilbert spaces
- Successive Averages of Firmly Nonexpansive Mappings
- The multiple-sets split feasibility problem and its applications for inverse problems
- Weak Sharp Minima in Mathematical Programming
Cited in
(9)- On convergence of a stochastic quasigradient algorithm of quantile optimization
- Adaptive subgradient method for the split quasi-convex feasibility problems
- Stochastic subgradient method for quasi-convex optimization problems
- A nonrandom variational approach to stochastic linear quadratic Gaussian optimization involving fractional noises (FLQG)
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- Algorithms for the quasiconvex feasibility problem
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization
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)
