Finitely convergent iterative methods with overrelaxations revisited
From MaRDI portal
Publication:2239369
DOI10.1007/s11784-021-00888-8OpenAlexW3196307554MaRDI QIDQ2239369
Simeon Reich, Victor I. Kolobov, Rafał Zalas
Publication date: 3 November 2021
Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.00471
Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (3)
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ A new low-cost feasible projection algorithm for pseudomonotone variational inequalities ⋮ Finite convergence of extragradient-type methods for solving variational inequalities under weak sharp condition
Cites Work
- 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
- On the interiors of production sets in infinite dimensional spaces
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Necessary optimality conditions for infinite dimensional state constrained control problems
- Variational analysis on the signed distance functions
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
- Convergence rates for boundedly regular systems
- A variational approach to the alternating projections method
- Necessary conditions for linear convergence of iterated expansive, set-valued mappings
- On the finite convergence of a projected cutter method
- Set intersection problems: supporting hyperplanes and quadratic programming
- On the use of the quasi-relative interior in optimization
- Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- A general convergence principle in nonlinear functional analysis
- A finitely convergent algorithm for convex inequalities
- On finitely convergent iterative methods for the convex feasibility problem
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- On Projection Algorithms for Solving Convex Feasibility Problems
- Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
- The method of projections for finding the common point of convex sets
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finitely convergent iterative methods with overrelaxations revisited
