On the finite convergence of a projected cutter method
From MaRDI portal
Publication:2349845
DOI10.1007/s10957-014-0659-7zbMath1353.90108arXiv1405.2877OpenAlexW2059083091MaRDI QIDQ2349845
Caifang Wang, Jia Xu, Heinz H. Bauschke, Shawn Xianfu Wang
Publication date: 18 June 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.2877
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Set-valued operators (47H04) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items
Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, The method for solving the extension of general of the split feasibility problem and fixed point problem of the cutter, Subgradient projectors: extensions, theory, and characterizations, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, Finitely convergent iterative methods with overrelaxations revisited, Properties of subgradient projection iteration when applying to linear imaging system, A generalized block-iterative projection method for the common fixed point problem induced by cutters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Reflection-projection method for convex feasibility problems with an obtuse cone
- A finitely convergent ``row-action method for the convex feasibility problem
- Cyclic subgradient projections
- A finitely convergent algorithm for convex inequalities
- On finitely convergent iterative methods for the convex feasibility problem
- Monotone Operators and the Proximal Point Algorithm
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- On Subgradient Projectors
- The Adaptive Projected Subgradient Method Constrained by Families of Quasi-nonexpansive Mappings and Its Application to Online Learning
- Minimization of unsmooth functionals
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Convex analysis and monotone operator theory in Hilbert spaces
