Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions

DOI10.1081/NFA-200045806zbMath1156.90428WikidataQ56778754 ScholiaQ56778754MaRDI QIDQ4678768

Nobuhiko Ogura, Isao Yamada

Publication date: 23 May 2005

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

zbMATH Keywords

adaptive signal processingsubgradient projectionadaptive projected subgradient methodasymptotic minimization of sequence of convex functions

Mathematics Subject Classification ID

Convex programming (90C25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Methods of reduced gradient type (90C52)

Related Items (18)

Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Robustness of Mann's algorithm for nonexpansive mappings ⋮ Inertial iterative process for fixed points of certain quasi-nonexpansive mappings ⋮ Subgradient projectors: extensions, theory, and characterizations ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Regularized and inertial algorithms for common fixed points of nonlinear operators ⋮ Convex minimization over the fixed point set of demicontractive mappings ⋮ Algorithms for the split variational inequality problem ⋮ An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space ⋮ Robustness of Mann type algorithm with perturbed mapping for nonexpansive mappings in Banach spaces ⋮ Sliding window generalized kernel affine projection algorithm using projection mappings ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ A unified view of adaptive variable-metric projection algorithms ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem 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 ⋮ On Subgradient Projectors ⋮ On the finite convergence of a projected cutter method

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
• Ill-posed problems with a priori information
• Decomposition through formalization in a product space
• The behavior of LMS and NLMS algorithms in the presence of spherically invariant processes
• NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
• 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
• Weak convergence of the sequence of successive approximations for nonexpansive mappings
• 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: Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions