Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
From MaRDI portal
(Redirected from Publication:4678768)
Recommendations
- scientific article; zbMATH DE number 2196506
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
Cites work
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- Constrained adaptation algorithms employing Householder transformation
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Decomposition through formalization in a product space
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 3259563 (Why is no real title available?)
- 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
- The behavior of LMS and NLMS algorithms in the presence of spherically invariant processes
- The method of projections for finding the common point of convex sets
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(21)- Subgradient projectors: extensions, theory, and characterizations
- On the finite convergence of a projected cutter method
- Extrapolation algorithm for affine-convex feasibility problems
- An adaptive gradient law with projection for non-smooth convex boundaries
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Set-theoretic adaptive filtering based on data-driven sparsification
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- On subgradient projectors
- The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
- String-averaging algorithms for convex feasibility with infinitely many sets
- An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
- scientific article; zbMATH DE number 2196506 (Why is no real title available?)
- Algorithms for the split variational inequality problem
- Robustness of Mann's algorithm for nonexpansive mappings
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- Regularized and inertial algorithms for common fixed points of nonlinear operators
- Convex minimization over the fixed point set of demicontractive mappings
- Robustness of Mann type algorithm with perturbed mapping for nonexpansive mappings in Banach spaces
- Sliding window generalized kernel affine projection algorithm using projection mappings
- A unified view of adaptive variable-metric projection algorithms
This page was built for publication: Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678768)
