Iterative methods of solving stochastic convex feasibility problems and applications
DOI10.1023/A:1008795702124zbMATH Open0947.90080WikidataQ58048638 ScholiaQ58048638MaRDI QIDQ1567488FDOQ1567488
Authors: Dan Butnariu, Alfredo Iusem, R. S. Burachik 
Publication date: 29 October 2000
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Recommendations
- Iterative averaging of entropic projections for solving stochastic convex feasibility problems
- Strong convergence of expected-projection methods in hilbert spaces
- Solving stochastic convex feasibility problems in hilbert spaces
- Block-iterative surrogate projection methods for convex feasibility problems
Bregman functionBregman projectionBochner integraltotally convex functionmodulus of convexitystochastic convex feasibility problemlocal moduli of convexityregularly convex functionvery convex function
Cited In (17)
- The method of randomized Bregman projections for stochastic feasibility problems
- Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces
- Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces
- Subgradient method for convex feasibility on Riemannian manifolds
- Title not available (Why is that?)
- Generic convergence of algorithms for solving stochastic feasibility problems
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- Generic convergence of methods for solving stochastic feasibility problems
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Iterative stochastic methods for solving variational problems of mathematical physics and operations research
- The stochastic auxiliary problem principle in Banach spaces: measurability and convergence
- Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem
- Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Solving stochastic convex feasibility problems in hilbert spaces
- Iterative decomposition of stochastic optimization problems with first-order partial differential equations
- Generalized proximal point algorithms for multiobjective optimization problems
This page was built for publication: Iterative methods of solving stochastic convex feasibility problems and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567488)
