The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
DOI10.1080/01630560600884661zbMath1114.47066OpenAlexW2068400585MaRDI QIDQ3422786
Konstantinos Slavakis, Nobuhiko Ogura, Isao Yamada
Publication date: 14 February 2007
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560600884661
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Fixed-point theorems (47H10) Programming in abstract spaces (90C48) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Convex functions and convex programs in convex geometry (52A41) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ill-posed problems with a priori information
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- 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
- Constrained adaptation algorithms employing Householder transformation
- The method of projections for finding the common point of convex sets
- Minimization of unsmooth functionals
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
This page was built for publication: The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings