Iterative methods of solving stochastic convex feasibility problems and applications
From MaRDI portal
Publication:1567488
DOI10.1023/A:1008795702124zbMath0947.90080MaRDI QIDQ1567488
Dan Butnariu, Regina Sandra Burachik, Alfredo Noel Iusem
Publication date: 29 October 2000
Published in: Computational Optimization and Applications (Search for Journal in Brave)
modulus of convexityBochner integralBregman functionBregman projectiontotally convex functionstochastic convex feasibility problemlocal moduli of convexityregularly convex functionvery convex function
Related Items (10)
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ Subgradient method for convex feasibility on Riemannian manifolds ⋮ The method of randomized Bregman projections for stochastic feasibility problems ⋮ Asymptotic Behavior of Relatively Nonexpansive Operators in Banach Spaces ⋮ Unnamed Item ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ Weak Convergence of Orbits of Nonlinear Operators in Reflexive Banach Spaces ⋮ Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem
This page was built for publication: Iterative methods of solving stochastic convex feasibility problems and applications
