default search action
Vladimir N. Temlyakov
Person information
- affiliation: Department of Mathematics, University of South Carolina, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i28]Irina V. Limonova, Yuri Malykhin, Vladimir N. Temlyakov:
One-sided discretization inequalities and sampling recovery. CoRR abs/2402.00848 (2024) - 2023
- [j42]Vladimir N. Temlyakov:
Sampling discretization error of integral norms for function classes with small smoothness. J. Approx. Theory 293: 105913 (2023) - [j41]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On the cardinality of lower sets and universal discretization. J. Complex. 76: 101726 (2023) - [i27]Feng Dai, Vladimir N. Temlyakov:
Universal discretization and sparse sampling recovery. CoRR abs/2301.05962 (2023) - [i26]Feng Dai, Vladimir N. Temlyakov:
Random points are good for universal discretization. CoRR abs/2301.12536 (2023) - [i25]Vladimir N. Temlyakov:
On the rate of convergence of greedy algorithms. CoRR abs/2304.06423 (2023) - [i24]Vladimir N. Temlyakov:
Rate of convergence of Thresholding Greedy Algorithms. CoRR abs/2304.09586 (2023) - [i23]Egor D. Kosov, Vladimir N. Temlyakov:
Sampling discretization of the uniform norm and applications. CoRR abs/2306.14207 (2023) - [i22]Vladimir N. Temlyakov:
On universal sampling recovery in the uniform norm. CoRR abs/2307.04017 (2023) - [i21]Feng Dai, Vladimir N. Temlyakov:
Lebesgue-type inequalities in sparse sampling recovery. CoRR abs/2307.04161 (2023) - [i20]Egor D. Kosov, Vladimir N. Temlyakov:
Bounds for the sampling discretization error and their applications to universal sampling discretization. CoRR abs/2312.05670 (2023) - 2022
- [j40]Vladimir N. Temlyakov, Tino Ullrich
:
Approximation of functions with small mixed smoothness in the uniform norm. J. Approx. Theory 277: 105718 (2022) - [j39]Boris S. Kashin, Egor D. Kosov
Sampling discretization and related problems. J. Complex. 71: 101653 (2022) - [i19]Vladimir N. Temlyakov:
On universal sampling representation. CoRR abs/2201.00415 (2022) - [i18]Vladimir N. Temlyakov:
Sampling discretization error of integral norms for function classes with small smoothness. CoRR abs/2203.07126 (2022) - [i17]Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov:
On cardinality of the lower sets and universal discretization. CoRR abs/2208.02113 (2022) - [i16]Feng Dai, Egor D. Kosov, Vladimir N. Temlyakov:
Some improved bounds in sampling discretization of integral norms. CoRR abs/2208.09762 (2022) - 2021
- [j38]Vladimir N. Temlyakov:
On optimal recovery in L2. J. Complex. 65: 101545 (2021) - [j37]Vladimir N. Temlyakov, Tino Ullrich:
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness. J. Complex. 67: 101575 (2021) - [i15]Boris S. Kashin, Vladimir N. Temlyakov:
A remark on discretization of the uniform norm. CoRR abs/2104.01229 (2021) - [i14]Feng Dai, Vladimir N. Temlyakov:
Universal sampling discretization. CoRR abs/2107.11476 (2021) - [i13]Feng Dai, Vladimir N. Temlyakov:
Sampling discretization of integral norms and its application. CoRR abs/2109.09030 (2021) - 2020
- [j36]Leyla Burusheva, Vladimir N. Temlyakov:
Sparse approximation of individual functions. J. Approx. Theory 259: 105471 (2020) - [j35]Vladimir N. Temlyakov, Mario Ullrich:
On the fixed volume discrepancy of the Fibonacci sets in the integral norms. J. Complex. 61: 101472 (2020) - [i12]Anton Dereventsov
Biorthogonal greedy algorithms in convex optimization. CoRR abs/2001.05530 (2020) - [i11]Feng Dai, Andriy Prymak, A. Shadrin, Vladimir N. Temlyakov, S. Yu. Tikhonov:
Sampling discretization of integral norms. CoRR abs/2001.09320 (2020) - [i10]A. S. Rubtsova, K. S. Ryutin, Vladimir N. Temlyakov:
On the fixed volume discrepancy of the Korobov point sets. CoRR abs/2003.07234 (2020) - [i9]Vladimir N. Temlyakov:
Numerical integration without smoothness assumption. CoRR abs/2003.14331 (2020) - [i8]Vladimir N. Temlyakov:
Sampling discretization of integral norms of the hyperbolic cross polynomials. CoRR abs/2005.05967 (2020) - [i7]Vladimir N. Temlyakov:
A remark on entropy numbers. CoRR abs/2008.13030 (2020) - [i6]Irina V. Limonova, Vladimir N. Temlyakov:
On sampling discretization in L2. CoRR abs/2009.10789 (2020) - [i5]Vladimir N. Temlyakov:
On optimal recovery in L2. CoRR abs/2010.03103 (2020) - [i4]Vladimir N. Temlyakov, Tino Ullrich:
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness. CoRR abs/2012.09925 (2020) - [i3]Vladimir N. Temlyakov, Tino Ullrich:
Approximation of functions with small mixed smoothness in the uniform norm. CoRR abs/2012.11983 (2020)
2010 – 2019
- 2019
- [j34]Vladimir N. Temlyakov:
Smooth fixed volume discrepancy, dispersion, and related problems. J. Approx. Theory 237: 113-134 (2019) - [j33]Vladimir N. Temlyakov:
Sampling discretization error of integral norms for function classes. J. Complex. 54 (2019) - [i2]Vladimir N. Temlyakov, Mario Ullrich:
On the fixed volume discrepancy of the Fibonacci sets in the integral norms. CoRR abs/1908.04658 (2019) - [i1]Leyla Burusheva, Vladimir N. Temlyakov:
Sparse approximation of individual functions. CoRR abs/1911.02593 (2019) - 2018
- [j32]Vladimir N. Temlyakov:
Universal discretization. J. Complex. 47: 97-109 (2018) - 2017
- [j31]Vladimir N. Temlyakov:
On the entropy numbers of the mixed smoothness function classes. J. Approx. Theory 217: 26-56 (2017) - 2016
- [j30]Ronald A. DeVore, Vladimir N. Temlyakov:
Convex Optimization on Banach Spaces. Found. Comput. Math. 16(2): 369-394 (2016) - 2015
- [j29]Daurenbek Bazarkhanov, Vladimir N. Temlyakov:
Nonlinear tensor product approximation of functions. J. Complex. 31(6): 867-884 (2015) - 2014
- [j28]Eugene D. Livshitz, Vladimir N. Temlyakov:
Sparse Approximation and Recovery by Greedy Algorithms. IEEE Trans. Inf. Theory 60(7): 3989-4000 (2014) - [c2]Vladimir N. Temlyakov:
Greedy algorithms in convex optimization on Banach spaces. ACSSC 2014: 1331-1335 - [c1]Vladimir N. Temlyakov:
Incremental Greedy Algorithm and Its Applications in Numerical Integration. MCQMC 2014: 557-570 - 2013
- [j27]Vladimir N. Temlyakov:
An inequality for the entropy numbers and its application. J. Approx. Theory 173: 110-121 (2013) - [j26]Daniel Savu, Vladimir N. Temlyakov:
Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces. IEEE Trans. Inf. Theory 59(2): 1098-1106 (2013) - 2012
- [j25]Entao Liu, Vladimir N. Temlyakov:
Super greedy type algorithms. Adv. Comput. Math. 37(4): 493-504 (2012) - [j24]Dmitriy Bilyk
Fibonacci sets and symmetrization in discrepancy theory. J. Complex. 28(1): 18-36 (2012) - [j23]Entao Liu, Vladimir N. Temlyakov:
The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing. IEEE Trans. Inf. Theory 58(4): 2040-2047 (2012) - 2011
- [j22]Vladimir N. Temlyakov, Mingrui Yang, Peixin Ye:
Greedy approximation with regard to non-greedy bases. Adv. Comput. Math. 34(3): 319-337 (2011) - [j21]Vladimir N. Temlyakov, Pavel Zheltov:
On performance of greedy algorithms. J. Approx. Theory 163(9): 1134-1145 (2011) - [j20]J. L. Nelson, Vladimir N. Temlyakov:
On the size of incoherent systems. J. Approx. Theory 163(9): 1238-1245 (2011)
2000 – 2009
- 2007
- [j19]Vladimir N. Temlyakov:
Greedy expansions in Banach spaces. Adv. Comput. Math. 26(4): 431-449 (2007) - [j18]David L. Donoho, Michael Elad, Vladimir N. Temlyakov:
On Lebesgue-type inequalities for greedy approximation. J. Approx. Theory 147(2): 185-195 (2007) - 2006
- [j17]Dany Leviatan, Vladimir N. Temlyakov:
Simultaneous approximation by greedy algorithms. Adv. Comput. Math. 25(1-3): 73-90 (2006) - [j16]Ronald A. DeVore, Gerard Kerkyacharian, Dominique Picard, Vladimir N. Temlyakov:
Approximation Methods for Supervised Learning. Found. Comput. Math. 6(1): 3-58 (2006) - [j15]David L. Donoho, Michael Elad, Vladimir N. Temlyakov:
Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory 52(1): 6-18 (2006) - 2005
- [j14]Dany Leviatan, Vladimir N. Temlyakov:
Simultaneous greedy approximation in Banach spaces. J. Complex. 21(3): 275-293 (2005) - [j13]Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore, Vladimir N. Temlyakov:
Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions. J. Mach. Learn. Res. 6: 1297-1321 (2005) - 2003
- [j12]Vladimir N. Temlyakov:
Nonlinear Methods of Approximation. Found. Comput. Math. 3(1): 33-107 (2003) - [j11]Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov:
Best Basis Selection for Approximation in Lp. Found. Comput. Math. 3(2): 161-185 (2003) - [j10]Vladimir N. Temlyakov:
Cubature formulas, discrepancy, and nonlinear approximation. J. Complex. 19(3): 352-391 (2003) - [j9]Adam Lutoborski, Vladimir N. Temlyakov:
Vector greedy algorithms. J. Complex. 19(4): 458-473 (2003) - 2002
- [j8]Vladimir N. Temlyakov:
A Criterion for Convergence of Weak Greedy Algorithms. Adv. Comput. Math. 17(3): 269-280 (2002) - 2001
- [j7]Vladimir N. Temlyakov:
Greedy algorithms in Banach spaces. Adv. Comput. Math. 14(3): 277-292 (2001) - 2000
- [j6]Vladimir N. Temlyakov:
Weak greedy algorithms. Adv. Comput. Math. 12(2-3): 213-227 (2000)
1990 – 1999
- 1998
- [j5]Vladimir N. Temlyakov:
The best m-term approximation and greedy algorithms. Adv. Comput. Math. 8(3): 249-265 (1998) - 1997
- [j4]Ronald A. DeVore, Vladimir N. Temlyakov:
Nonlinear Approximation in Finite-Dimensional Spaces. J. Complex. 13(4): 489-508 (1997) - 1996
- [j3]Ronald A. DeVore, Vladimir N. Temlyakov:
Some remarks on greedy algorithms. Adv. Comput. Math. 5(1): 173-187 (1996) - 1995
- [j2]Vladimir N. Temlyakov:
An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers. J. Complex. 11(2): 293-307 (1995) - 1993
- [j1]Vladimir N. Temlyakov:
On Approximate Recovery of Functions with Bounded Mixed Derivative. J. Complex. 9(1): 41-59 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: