Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (Q4678768)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2171219
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions |
scientific article; zbMATH DE number 2171219 |
Statements
Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions (English)
0 references
23 May 2005
0 references
adaptive projected subgradient method
0 references
asymptotic minimization of sequence of convex functions
0 references
subgradient projection
0 references
adaptive signal processing
0 references
0 references
0 references
0 references
0 references
0.883292019367218
0 references
0.8575330376625061
0 references
0.7941476702690125
0 references
The purpose of this paper is to present a unified guiding principle for asymptotic minimization of a sequence of nonnegative convex functions over a closed convex subset in a Hilbert space. The algorithm which was named by adaptive projected subgradient method for minimizing asymptotically a certain sequence of nonnegative convex functions, is an extension of the Polyak's subgradient algorithm for nonsmooth convex optimization problem with a fixed target value, to the case where the convex objective itself keeps changing in the whole process. The main theorem on the proposed algorithm can serve as a useful mathematical foundation of a wide range of the projection based adaptive filtering algorithms.
0 references