Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
From MaRDI portal
Publication:2149580
DOI10.1007/s10107-021-01628-zOpenAlexW3132513737MaRDI QIDQ2149580
Simeon Reich, Victor I. Kolobov, Rafał Zalas
Publication date: 29 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.05660
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (6)
Convergence of the Cimmino algorithm for common fixed point problems with a countable family of operators ⋮ Finite convergence of extragradient-type methods for solving variational inequalities under weak sharp condition ⋮ Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space ⋮ Unnamed Item ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Linear and strong convergence of algorithms involving averaged nonexpansive operators
- Iterative methods for fixed point problems in Hilbert spaces
- Finding common fixed points of a class of paracontractions
- Finite convergence of a subgradient projections method with expanding controls
- A finitely convergent ``row-action method for the convex feasibility problem
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- On the finite convergence of a projected cutter method
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Set intersection problems: supporting hyperplanes and quadratic programming
- Opial-Type Theorems and the Common Fixed Point Problem
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Efficient controls for finitely convergent sequential algorithms
- A finitely convergent algorithm for convex inequalities
- On finitely convergent iterative methods for the convex feasibility problem
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Random Function Iterations for Consistent Stochastic Feasibility
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
