The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
From MaRDI portal
Publication:3422786
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)
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
Cites work
- scientific article; zbMATH DE number 50447 (Why is no real title available?)
- scientific article; zbMATH DE number 1376935 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3259563 (Why is no real title available?)
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Constrained adaptation algorithms employing Householder transformation
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- Quadratic optimization of fixed points of nonexpansive mappings in hubert space
- The method of projections for finding the common point of convex sets
Cited in
(7)- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- scientific article; zbMATH DE number 2196506 (Why is no real title available?)
- 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
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)