Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems

نویسندگان

چکیده

We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior solution set is nonempty and certain overrelaxation parameters form divergent series. combine our with very general class deterministic control sequences where, roughly speaking, require sooner or later encounter violated constraint if one exists. This requirement satisfied, particular, by cyclic, repetitive remotest controls. Moreover, it almost surely satisfied random

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems

The problem considered in this paper is that of finding a point which is common to almost all the members of a measurable family of closed convex subsets of R++, provided that such a point exists. The main results show that this problem can be solved by an iterative method essentially based on averaging at each step the Bregman projections with respect to f (x) =∑n i=1 xi · ln xi of the current...

متن کامل

Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces

The purpose of this paper is to use the modified block iterative method to propose an algorithm for solving the convex feasibility problems for an infinite family of quasi-φ-asymptotically nonexpansive mappings. Under suitable conditions some strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces with Kadec-Klee property. The results presented in the p...

متن کامل

Some Iterative Methods for Solving Equilibrium Problems and Optimization Problems

We introduce a new iterative scheme for finding a common element of the set of solutions of the equilibrium problems, the set of solutions of variational inequality for a relaxed cocoercive mapping, and the set of fixed points of a nonexpansive mapping. The results presented in this paper extend and improve some recent results of Ceng and Yao 2008 , Yao 2007 , S. Takahashi andW. Takahashi 2007 ...

متن کامل

Solving Multistage Mixed Nonlinear Convex Stochastic Problems

We present an algorithm to solve multistage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0–1 mixed-integer and continuous variables in all the stages. The non-anticipativity constraints are satisfied bymeans of the twin-nodefamily strategy. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Programming

سال: 2021

ISSN: ['0025-5610', '1436-4646']

DOI: https://doi.org/10.1007/s10107-021-01628-z