On the Approximate Weak Chebyshev Greedy Algorithm in uniformly smooth Banach spaces

We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA), introduced and studied in [6], is defined for any Banach space X and a dictionary D, and provides nonlinear n-term approximation with respect to D. In this paper we study the Approximate Weak...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of mathematical analysis and applications Ročník 436; číslo 1; s. 288 - 304
Hlavní autor: Dereventsov, A.V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.04.2016
Témata:
ISSN:0022-247X, 1096-0813
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA), introduced and studied in [6], is defined for any Banach space X and a dictionary D, and provides nonlinear n-term approximation with respect to D. In this paper we study the Approximate Weak Chebyshev Greedy Algorithm (AWCGA) – a modification of the WCGA that was studied in [7]. In the AWCGA we are allowed to calculate n-term approximation with a perturbation in computing the norming functional and a relative error in calculating the approximant. Such permission is natural for the numerical applications and simplifies realization of the algorithm. We obtain conditions that are necessary and sufficient for the convergence of the AWCGA for any element of X. In particular, we show that if perturbations and errors are from ℓ1 space then the conditions for the convergence of the AWCGA are the same as for the WCGA. For specifically chosen perturbations and errors we estimate the rate of convergence for any element f from the closure of the convex hull of D and demonstrate that in special cases the AWCGA performs as well as the WCGA.
AbstractList We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA), introduced and studied in [6], is defined for any Banach space X and a dictionary D, and provides nonlinear n-term approximation with respect to D. In this paper we study the Approximate Weak Chebyshev Greedy Algorithm (AWCGA) – a modification of the WCGA that was studied in [7]. In the AWCGA we are allowed to calculate n-term approximation with a perturbation in computing the norming functional and a relative error in calculating the approximant. Such permission is natural for the numerical applications and simplifies realization of the algorithm. We obtain conditions that are necessary and sufficient for the convergence of the AWCGA for any element of X. In particular, we show that if perturbations and errors are from ℓ1 space then the conditions for the convergence of the AWCGA are the same as for the WCGA. For specifically chosen perturbations and errors we estimate the rate of convergence for any element f from the closure of the convex hull of D and demonstrate that in special cases the AWCGA performs as well as the WCGA.
Author Dereventsov, A.V.
Author_xml – sequence: 1
  givenname: A.V.
  surname: Dereventsov
  fullname: Dereventsov, A.V.
  email: dereventsov@gmail.com
BookMark eNp9kEFLwzAcxYMouE2_gKd8gdZ_0rRdwcscOoXBLhO9hTRNbWqblCQO--3tmCcPOz3e4ffg_ebo0lijELojEBMg2X0bt70QMQWSxoTGANkFmhEosgiWJLlEMwBKI8ryj2s0974FICTNyQztdwaHRuHVMDj7o3sRFH5X4guvG1WOvlEHvHFKVSNedZ_W6dD0WBv8bXRtXd-N2PfWhgY_CiNkg_0gpPI36KoWnVe3f7lAb89P-_VLtN1tXterbSQZYSFKEyAJy4BNVZYllCnkkkHCoKS0hkQUlNWkSFiZMoCiKNO8yuu0rIFmhMllskDL06501nunai51EEFbE5zQHSfAj3Z4y492-NEOJ5RPdiaU_kMHN71343no4QSp6dRBK8e91MpIVWmnZOCV1efwX73Df4o
CitedBy_id crossref_primary_10_3390_axioms14060446
crossref_primary_10_3103_S0146411617010060
crossref_primary_10_1134_S0965542519060113
crossref_primary_10_1016_j_acha_2022_05_001
crossref_primary_10_1016_j_jfa_2019_108286
Cites_doi 10.1007/s00041-002-0023-4
10.1007/BF02762802
10.1007/s00365-004-0565-6
10.1023/A:1016657209416
10.1007/BF02678464
ContentType Journal Article
Copyright 2015 Elsevier Inc.
Copyright_xml – notice: 2015 Elsevier Inc.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.jmaa.2015.12.006
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1096-0813
EndPage 304
ExternalDocumentID 10_1016_j_jmaa_2015_12_006
S0022247X15011129
GroupedDBID --K
--M
--Z
-~X
.~1
0R~
0SF
1B1
1RT
1~.
4.4
457
4G.
5GY
6I.
71M
85S
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABVKL
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DM4
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
HVGLF
IHE
IXB
J1W
KOM
LG5
M25
M41
MCRUF
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SPC
SPCBC
SSW
SSZ
T5K
TN5
TWZ
UPT
WH7
XPP
YQT
ZMT
ZU3
~G-
1~5
29L
5VS
6TJ
7-5
9DU
AAQFI
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABUFD
ABWVN
ABXDB
ACLOT
ACRPL
ACVFH
ADCNI
ADFGL
ADIYS
ADMUD
ADNMO
ADVLN
ADXHL
AEIPS
AETEA
AEUPX
AFFNX
AFJKZ
AFPUW
AGHFR
AGQPQ
AI.
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CAG
CITATION
COF
EFKBS
FGOYB
G-2
HZ~
H~9
MVM
OHT
R2-
SEW
VH1
VOH
WUQ
XOL
YYP
ZCG
~HD
ID FETCH-LOGICAL-c414t-530134604c41cbb0b507c40340b22f03a924f1934b540099b57d7f5bf02614c83
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000369115200018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0022-247X
IngestDate Tue Nov 18 22:28:50 EST 2025
Sat Nov 29 07:29:56 EST 2025
Fri Feb 23 02:40:27 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Greedy algorithm
Weak Chebyshev Greedy Algorithm
Approximate Weak Chebyshev Greedy Algorithm
Banach space
Nonlinear approximation
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c414t-530134604c41cbb0b507c40340b22f03a924f1934b540099b57d7f5bf02614c83
OpenAccessLink https://dx.doi.org/10.1016/j.jmaa.2015.12.006
PageCount 17
ParticipantIDs crossref_citationtrail_10_1016_j_jmaa_2015_12_006
crossref_primary_10_1016_j_jmaa_2015_12_006
elsevier_sciencedirect_doi_10_1016_j_jmaa_2015_12_006
PublicationCentury 2000
PublicationDate 2016-04-01
PublicationDateYYYYMMDD 2016-04-01
PublicationDate_xml – month: 04
  year: 2016
  text: 2016-04-01
  day: 01
PublicationDecade 2010
PublicationTitle Journal of mathematical analysis and applications
PublicationYear 2016
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Enflo (br0050) 1972; 13
Dubinin (br0040) 1997
Temlyakov (br0070) 2005; 21
Beauzamy (br0010) 1982
Temlyakov (br0060) 2001; 14
Temlyakov (br0080) 2011
Dilworth, Kutzarova, Temlyakov (br0020) 2002; 8
Donahue, Darken, Gurvits, Sontag (br0030) 1997; 13
Dilworth (10.1016/j.jmaa.2015.12.006_br0020) 2002; 8
Dubinin (10.1016/j.jmaa.2015.12.006_br0040) 1997
Temlyakov (10.1016/j.jmaa.2015.12.006_br0080) 2011
Donahue (10.1016/j.jmaa.2015.12.006_br0030) 1997; 13
Temlyakov (10.1016/j.jmaa.2015.12.006_br0070) 2005; 21
Enflo (10.1016/j.jmaa.2015.12.006_br0050) 1972; 13
Beauzamy (10.1016/j.jmaa.2015.12.006_br0010) 1982
Temlyakov (10.1016/j.jmaa.2015.12.006_br0060) 2001; 14
References_xml – volume: 21
  start-page: 257
  year: 2005
  end-page: 292
  ident: br0070
  article-title: Greedy-type approximation in Banach spaces and applications
  publication-title: Constr. Approx.
– year: 1997
  ident: br0040
  article-title: Greedy algorithms and applications
– volume: 14
  start-page: 277
  year: 2001
  end-page: 292
  ident: br0060
  article-title: Greedy algorithms in Banach spaces
  publication-title: Adv. Comput. Math.
– volume: 13
  start-page: 187
  year: 1997
  end-page: 220
  ident: br0030
  article-title: Rates of convex approximation in non-Hilbert spaces
  publication-title: Constr. Approx.
– volume: 13
  start-page: 281
  year: 1972
  end-page: 288
  ident: br0050
  article-title: Banach spaces which can be given an equivalent uniformly convex norm
  publication-title: Israel J. Math.
– year: 1982
  ident: br0010
  article-title: Introduction to Banach Spaces and Their Geometry
– volume: 8
  start-page: 489
  year: 2002
  end-page: 506
  ident: br0020
  article-title: Convergence of some greedy algorithms in Banach spaces
  publication-title: J. Fourier Anal. Appl.
– year: 2011
  ident: br0080
  article-title: Greedy Approximation
– volume: 8
  start-page: 489
  issue: 5
  year: 2002
  ident: 10.1016/j.jmaa.2015.12.006_br0020
  article-title: Convergence of some greedy algorithms in Banach spaces
  publication-title: J. Fourier Anal. Appl.
  doi: 10.1007/s00041-002-0023-4
– volume: 13
  start-page: 281
  issue: 3
  year: 1972
  ident: 10.1016/j.jmaa.2015.12.006_br0050
  article-title: Banach spaces which can be given an equivalent uniformly convex norm
  publication-title: Israel J. Math.
  doi: 10.1007/BF02762802
– volume: 21
  start-page: 257
  issue: 2
  year: 2005
  ident: 10.1016/j.jmaa.2015.12.006_br0070
  article-title: Greedy-type approximation in Banach spaces and applications
  publication-title: Constr. Approx.
  doi: 10.1007/s00365-004-0565-6
– volume: 14
  start-page: 277
  issue: 3
  year: 2001
  ident: 10.1016/j.jmaa.2015.12.006_br0060
  article-title: Greedy algorithms in Banach spaces
  publication-title: Adv. Comput. Math.
  doi: 10.1023/A:1016657209416
– volume: 13
  start-page: 187
  issue: 2
  year: 1997
  ident: 10.1016/j.jmaa.2015.12.006_br0030
  article-title: Rates of convex approximation in non-Hilbert spaces
  publication-title: Constr. Approx.
  doi: 10.1007/BF02678464
– year: 1997
  ident: 10.1016/j.jmaa.2015.12.006_br0040
– year: 2011
  ident: 10.1016/j.jmaa.2015.12.006_br0080
– year: 1982
  ident: 10.1016/j.jmaa.2015.12.006_br0010
SSID ssj0011571
Score 2.2103968
Snippet We study greedy approximation in uniformly smooth Banach spaces. The Weak Chebyshev Greedy Algorithm (WCGA), introduced and studied in [6], is defined for any...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 288
SubjectTerms Approximate Weak Chebyshev Greedy Algorithm
Banach space
Greedy algorithm
Nonlinear approximation
Weak Chebyshev Greedy Algorithm
Title On the Approximate Weak Chebyshev Greedy Algorithm in uniformly smooth Banach spaces
URI https://dx.doi.org/10.1016/j.jmaa.2015.12.006
Volume 436
WOSCitedRecordID wos000369115200018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1096-0813
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0011571
  issn: 0022-247X
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6hlgMcEE9RXtoDN8uRvY-sfUyrIkDQcgglN8u7XtOEeFPFaZT-e2a9m61pS0UPXKzYiteJv0_jmfHMNwi9t3aRaK5indMqZlTmscxYHQ9LIiUjgqiufezkizg6yiaT_JvvLmm7cQLCmGyzyc_-K9RwDMC2rbN3gDssCgfgM4AOW4Adtv8E_LErXBxZsfDNFBxSHf3Q5a_o4FTbXLRe274UsK3RaP5zsZyuThub8zg3tkWrmV9EbbMA9KL90thWKzA4ypcZXndhm6D52ikOeHmTTv619148-MrayUW1i3VnkQYng37OIR32SlUuewAI64bcBzvKnJLJH4TxVtFN7vMPWOrmDV-z3S6NMBvMmtIKQqW8y9MmNwhlX3mAhbLCbcXarLBrFHaNIiVFJ8m-SwTPweztjj4dTj6HF00pF-lWUN7-Id9X5UoAr_6Sm32Xnj8yfoweeRTwyBHgCbqnzVP08GtApH2GxscGwy7uUQFbKuBABeyogAMV8NTgQAXsqIAdFbCjwnP0_cPh-OBj7KdoxIqlbBVzMOGUDRMGu0rKREIEoFhCWSIJqRNaQgRegxvPJDjvEC9ILipRc1nb6JypjL5AO2Zh9EuEs0zlCuLjXNCSVXlVclKquhJa0jqVot5D6fb-FMpLzNtJJ_Pi78jsoSicc-YEVm79Nt_e9sK7iM71K4BFt5z36k5XeY0eXLL-DdpZLc_1W3RfrVfTdvnOU-g3cPOIEQ
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Approximate+Weak+Chebyshev+Greedy+Algorithm+in+uniformly+smooth+Banach+spaces&rft.jtitle=Journal+of+mathematical+analysis+and+applications&rft.au=Dereventsov%2C+A.V.&rft.date=2016-04-01&rft.issn=0022-247X&rft.volume=436&rft.issue=1&rft.spage=288&rft.epage=304&rft_id=info:doi/10.1016%2Fj.jmaa.2015.12.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jmaa_2015_12_006
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-247X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-247X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-247X&client=summon