The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
DOI10.1080/01630560600884661zbMATH Open1114.47066OpenAlexW2068400585MaRDI QIDQ3422786FDOQ3422786
Authors: Konstantinos Slavakis, Isao Yamada, Nobuhiko Ogura 
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
Recommendations
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- scientific article; zbMATH DE number 2196506
- An infeasible-point subgradient method using adaptive approximate projections
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
- Inexact subgradient methods with applications in stochastic programming
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Optimization on solution sets of common fixed point problems
- Set-theoretic adaptive filtering based on data-driven sparsification
- A strongly convergent method for nonsmooth convex minimization in Hilbert spaces
- A subgradient method for vector optimization problems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Fixed-point theorems (47H10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convex functions and convex programs in convex geometry (52A41) Programming in abstract spaces (90C48)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- 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
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- Ill-posed problems with a priori information
- Minimization of unsmooth functionals
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Title not available (Why is that?)
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Constrained adaptation algorithms employing Householder transformation
Cited In (7)
- Title not available (Why is that?)
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Sliding window generalized kernel affine projection algorithm using projection mappings
- The Bruck's ergodic iteration method for the Ky Fan inequality over the fixed point set
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
This page was built for publication: The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422786)
