Vladimir N. Temlyakov

According to our database, Vladimir N. Temlyakov authored at least 67 papers between 1993 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Twenty-five years of greedy bases.

Fernando Albiac, José L. Ansorena, Vladimir N. Temlyakov

J. Approx. Theory, 2025

2024

One-sided discretization inequalities and sampling recovery.

Irina V. Limonova, Yuri Malykhin, Vladimir N. Temlyakov

CoRR, 2024

2023

Sampling discretization error of integral norms for function classes with small smoothness.

Vladimir N. Temlyakov

J. Approx. Theory, September, 2023

On the cardinality of lower sets and universal discretization.

Feng Dai, A. V. Prymak, A. Shadrin, Vladimir N. Temlyakov, Sergey Tikhonov

J. Complex., June, 2023

Bounds for the sampling discretization error and their applications to universal sampling discretization.

Egor D. Kosov, Vladimir N. Temlyakov

CoRR, 2023

Lebesgue-type inequalities in sparse sampling recovery.

Feng Dai, Vladimir N. Temlyakov

CoRR, 2023

On universal sampling recovery in the uniform norm.

Vladimir N. Temlyakov

CoRR, 2023

Sampling discretization of the uniform norm and applications.

Egor D. Kosov, Vladimir N. Temlyakov

CoRR, 2023

Rate of convergence of Thresholding Greedy Algorithms.

Vladimir N. Temlyakov

CoRR, 2023

On the rate of convergence of greedy algorithms.

Vladimir N. Temlyakov

CoRR, 2023

Random points are good for universal discretization.

Feng Dai, Vladimir N. Temlyakov

CoRR, 2023

Universal discretization and sparse sampling recovery.

Feng Dai, Vladimir N. Temlyakov

CoRR, 2023

2022

Sampling discretization and related problems.

Boris S. Kashin, Egor D. Kosov, Irina V. Limonova, Vladimir N. Temlyakov

J. Complex., 2022

Approximation of functions with small mixed smoothness in the uniform norm.

Vladimir N. Temlyakov, Tino Ullrich

J. Approx. Theory, 2022

Some improved bounds in sampling discretization of integral norms.

Feng Dai, Egor D. Kosov, Vladimir N. Temlyakov

CoRR, 2022

On universal sampling representation.

Vladimir N. Temlyakov

CoRR, 2022

2021

Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness.

Vladimir N. Temlyakov, Tino Ullrich

J. Complex., 2021

On optimal recovery in L2.

Vladimir N. Temlyakov

J. Complex., 2021

Sampling discretization of integral norms and its application.

Feng Dai, Vladimir N. Temlyakov

CoRR, 2021

Universal sampling discretization.

Feng Dai, Vladimir N. Temlyakov

CoRR, 2021

A remark on discretization of the uniform norm.

Boris S. Kashin, Vladimir N. Temlyakov

CoRR, 2021

2020

On the fixed volume discrepancy of the Fibonacci sets in the integral norms.

Vladimir N. Temlyakov, Mario Ullrich

J. Complex., 2020

Sparse approximation of individual functions.

Leyla Burusheva, Vladimir N. Temlyakov

J. Approx. Theory, 2020

On optimal recovery in L₂.

Vladimir N. Temlyakov

CoRR, 2020

On sampling discretization in L₂.

Irina V. Limonova, Vladimir N. Temlyakov

CoRR, 2020

A remark on entropy numbers.

Vladimir N. Temlyakov

CoRR, 2020

Sampling discretization of integral norms of the hyperbolic cross polynomials.

Vladimir N. Temlyakov

CoRR, 2020

Numerical integration without smoothness assumption.

Vladimir N. Temlyakov

CoRR, 2020

On the fixed volume discrepancy of the Korobov point sets.

A. S. Rubtsova, K. S. Ryutin, Vladimir N. Temlyakov

CoRR, 2020

Sampling discretization of integral norms.

Feng Dai, Andriy Prymak, A. Shadrin, Vladimir N. Temlyakov, S. Yu. Tikhonov

CoRR, 2020

Biorthogonal greedy algorithms in convex optimization.

Anton Dereventsov, Vladimir N. Temlyakov

CoRR, 2020

2019

Sampling discretization error of integral norms for function classes.

Vladimir N. Temlyakov

J. Complex., 2019

Smooth fixed volume discrepancy, dispersion, and related problems.

Vladimir N. Temlyakov

J. Approx. Theory, 2019

2018

Universal discretization.

Vladimir N. Temlyakov

J. Complex., 2018

2017

On the entropy numbers of the mixed smoothness function classes.

Vladimir N. Temlyakov

J. Approx. Theory, 2017

2016

Convex Optimization on Banach Spaces.

Ronald A. DeVore, Vladimir N. Temlyakov

Found. Comput. Math., 2016

2015

Nonlinear tensor product approximation of functions.

Daurenbek Bazarkhanov, Vladimir N. Temlyakov

J. Complex., 2015

2014

Sparse Approximation and Recovery by Greedy Algorithms.

Eugene D. Livshitz, Vladimir N. Temlyakov

IEEE Trans. Inf. Theory, 2014

Incremental Greedy Algorithm and Its Applications in Numerical Integration.

Vladimir N. Temlyakov

Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

Greedy algorithms in convex optimization on Banach spaces.

Vladimir N. Temlyakov

Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013

Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces.

Daniel Savu, Vladimir N. Temlyakov

IEEE Trans. Inf. Theory, 2013

An inequality for the entropy numbers and its application.

Vladimir N. Temlyakov

J. Approx. Theory, 2013

2012

The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing.

Entao Liu, Vladimir N. Temlyakov

IEEE Trans. Inf. Theory, 2012

Fibonacci sets and symmetrization in discrepancy theory.

Dmitriy Bilyk, Vladimir N. Temlyakov, Rui Yu

J. Complex., 2012

Super greedy type algorithms.

Entao Liu, Vladimir N. Temlyakov

Adv. Comput. Math., 2012

2011

On performance of greedy algorithms.

Vladimir N. Temlyakov, Pavel Zheltov

J. Approx. Theory, 2011

On the size of incoherent systems.

J. L. Nelson, Vladimir N. Temlyakov

J. Approx. Theory, 2011

Greedy approximation with regard to non-greedy bases.

Vladimir N. Temlyakov, Mingrui Yang, Peixin Ye

Adv. Comput. Math., 2011

2007

On Lebesgue-type inequalities for greedy approximation.

David L. Donoho, Michael Elad, Vladimir N. Temlyakov

J. Approx. Theory, 2007

Greedy expansions in Banach spaces.

Vladimir N. Temlyakov

Adv. Comput. Math., 2007

2006

Stable recovery of sparse overcomplete representations in the presence of noise.

David L. Donoho, Michael Elad, Vladimir N. Temlyakov

IEEE Trans. Inf. Theory, 2006

Approximation Methods for Supervised Learning.

Ronald A. DeVore, Gerard Kerkyacharian, Dominique Picard, Vladimir N. Temlyakov

Found. Comput. Math., 2006

Simultaneous approximation by greedy algorithms.

Dany Leviatan, Vladimir N. Temlyakov

Adv. Comput. Math., 2006

2005

Universal Algorithms for Learning Theory Part I : Piecewise Constant Functions.

Peter Binev, Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore, Vladimir N. Temlyakov

J. Mach. Learn. Res., 2005

Simultaneous greedy approximation in Banach spaces.

Dany Leviatan, Vladimir N. Temlyakov

J. Complex., 2005

2003

Cubature formulas, discrepancy, and nonlinear approximation.

Vladimir N. Temlyakov

J. Complex., 2003

Vector greedy algorithms.

Adam Lutoborski, Vladimir N. Temlyakov

J. Complex., 2003

Nonlinear Methods of Approximation.

Vladimir N. Temlyakov

Found. Comput. Math., 2003

Best Basis Selection for Approximation in L_p.

Ronald A. DeVore, Guergana Petrova, Vladimir N. Temlyakov

Found. Comput. Math., 2003

2002

A Criterion for Convergence of Weak Greedy Algorithms.

Vladimir N. Temlyakov

Adv. Comput. Math., 2002

2001

Greedy algorithms in Banach spaces.

Vladimir N. Temlyakov

Adv. Comput. Math., 2001

2000

Weak greedy algorithms.

Vladimir N. Temlyakov

Adv. Comput. Math., 2000

1998

The best m-term approximation and greedy algorithms.

Vladimir N. Temlyakov

Adv. Comput. Math., 1998

1997

Nonlinear Approximation in Finite-Dimensional Spaces.

Ronald A. DeVore, Vladimir N. Temlyakov

J. Complex., 1997

1996

Some remarks on greedy algorithms.

Ronald A. DeVore, Vladimir N. Temlyakov

Adv. Comput. Math., 1996

1995

An Inequality for Trigonometric Polynomials and Its Application for Estimating the Entropy Numbers.

Vladimir N. Temlyakov

J. Complex., 1995

1993

On Approximate Recovery of Functions with Bounded Mixed Derivative.

Vladimir N. Temlyakov

J. Complex., 1993