A Criterion for Convergence of Weak Greedy Algorithms

Abstract

This paper completes the investigation of necessary and sufficient conditions on the "weakness" sequence for convergence of Weak Greedy Algorithm for all dictionary D and each function (vector) f in Hilbert space H. This paper is a follow up to the papers [T] and [LT]. The Weak Greedy Algorithms (WGA) were introduced in [T]. The paper [T] contains also historical remarks and some motivation of studying greedy and weak greedy algorithms. We will not repeat historical remarks from [T] here and refer the reader to [T] for prehistory of WGA. We discuss here results on WGA in detail.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2000
Accession Number
ADA637117

Entities

People

  • V. N. Temlyakov

Organizations

  • University of South Carolina

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Convergence
  • Hilbert Space
  • Information Operations
  • Mathematics
  • Sequences
  • South Carolina

Readers

  • Library and Information Science/ Studies, Southeast Asia Studies, Bibliography of Vietnam and Lao Studies.
  • Military History of the United States in the 20th Century.
  • Neural Network Machine Learning.

Technology Areas

  • Space