Generic convergence of algorithms for solving stochastic feasibility problems
From MaRDI portal
Recommendations
- Generic convergence of methods for solving stochastic feasibility problems
- General results on the convergence of stochastic algorithms
- scientific article; zbMATH DE number 1839493
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization
- Convergence of approximate optimal solution sets and values for a class of stochastic programs
- scientific article; zbMATH DE number 3970532
- Iterative methods of solving stochastic convex feasibility problems and applications
- Convergence properties of stochastic optimization procedures
- Convergence of discrete approximations of stochastic programming problems with probabilistic criteria
Cited in
(6)- The expected retraction method in Banach spaces
- Generic convergence of methods for solving stochastic feasibility problems
- Random function iterations for stochastic feasibility problems
- scientific article; zbMATH DE number 7733450 (Why is no real title available?)
- The generic approach to modern optimization
- Convergence of stochastic search algorithms to finite size Pareto set approximations
This page was built for publication: Generic convergence of algorithms for solving stochastic feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768021)