The DOI matches its Crossref record.
Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
Abstract
This paper presents an algorithm, named adaptive projected subgradient method that can minimize asymptotically a certain sequence of nonnegative convex functions over a closed convex set in a real Hilbert space. The proposed algorithm is a natural 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, showing the strong convergence of the algorithm as well as the asymptotic optimality of the sequence generated by the algorithm, can serve as a unified guiding principle of a wide range of set theoretic adaptive filtering schemes for nonstationary random processes. These include not only the existing adaptive filtering techniques; e.g., NLMS, Projected NLMS, Constrained NLMS, APA, and Adaptive parallel outer projection algorithm etc., but also new techniques; e.g., Adaptive parallel min-max projection algorithm, and their embedded constraint versions. Numerical examples show that the proposed techniques are well-suited for robust adaptive signal processing problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Iterative Methods for Fixed Point Problems in Hilbert Spaces
Cegielski, A. (2013) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-30901-4 · Cited by 318
Diffusion Least-Mean Squares With Adaptive Combiners: Formulation and Performance Analysis
Takahashi, N., Yamada, I., & Sayed, A. H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2051429 · Cited by 310
Self-citationDetection for 5G-NOMA: An Online Adaptive Machine Learning Approach
Awan, D. A., Cavalcante, R. L. G., Yukawa, M., & Stanczak, S. (2018) · 2018 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2018.8422449 · Cited by 37
Metadata
- Authors
- Yamada, I., & Ogura, N.
- Venue
- Numerical Functional Analysis and Optimization
- Publisher
- Informa UK Limited
- Published
- 2005-01-02
- Volume
- 25
- Issue
- 7-8
- Pages
- 593-617
- ISSN
- 0163-0563 (ISSN-L)
- 1532-2467
- OpenAlex
- W2005778669
- Cited by
- 185
- References
- 0
- FWCI
- 12.24
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions. https://app.cochat.ai/papers/10.1081/nfa-200045806
- The paper
- Yamada, I., & Ogura, N. (2005). Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions. Numerical Functional Analysis and Optimization. https://doi.org/10.1081/nfa-200045806
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.