Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems

Authors:
Dan Butnariu;Yair Censor;Simeon Reich
Affiliations:
Department of Mathematics and Computer Science, University of Haifa, 31905 Haifa, Israel;Department of Mathematics and Computer Science, University of Haifa, 31905 Haifa, Israel;Department of Mathematics, The Technion–Israel Institute of Technology, 32000 Haifa, Israel
Venue:
Computational Optimization and Applications
Year:
1997

Citing 7
Cited 5

Convergence results for an accelerated nonlinear cimmino algorithm

Numerische Mathematik
A relaxed version of Bregman's method for convex programming

Journal of Optimization Theory and Applications
Stochastic programming

Optimization
Scenarios and policy aggregation in optimization under uncertainty

Mathematics of Operations Research
Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces

Journal of Computational and Applied Mathematics
On Projection Algorithms for Solving Convex Feasibility Problems

SIAM Review
Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces

Journal of Optimization Theory and Applications

Iterative Methods of Solving Stochastic Convex Feasibility Problems andApplications

Computational Optimization and Applications
Bregman distances and Chebyshev sets

Journal of Approximation Theory
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces

Journal of Approximation Theory
Products of Finitely Many Resolvents of Maximal Monotone Mappings in Reflexive Banach Spaces

SIAM Journal on Optimization
Iterative Methods for Solving Systems of Variational Inequalities in Reflexive Banach Spaces

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are motivated by the problem of constructing aprimal-dual barrier function whose Hessian induces the (theoreticallyand practically) popular symmetric primal and dual scalings forlinear programming problems. Although this goal is impossible toattain, ...