Two Lower Estimates in Greedy Approximation

Abstract

We prove our lower estimate for the rate of convergence of Pure Greedy Algorithm with regard to a general dictionary and another lower estimate for the rate of convergence of Weak Greedy Algorithm with a special weakness sequence pie = {t}, 0 , t < 1, with regard to a general dictionary. The second lower estimate combined with the known upper estimate gives the right (in the sense of order) dependence of the exponent in the rate of convergence on the parameter t when t yield 0.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2001
Accession Number
ADA639860

Entities

People

  • V. N. Temlyakov

Organizations

  • University of South Carolina

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Availability
  • Classification
  • Contracts
  • Convergence
  • Dictionaries
  • Information Operations
  • Instructions
  • Mathematics
  • Monitoring
  • Security
  • Sequences
  • South Carolina
  • Standards

Readers

  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.
  • Operations Research