Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm
M. Berasategui, P. M. Berná, D. González
Full PDF
carpathian_2025_41_1_31_44Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná and Ó. Blasco gave a characterization of these bases using polynomials with constant coefficients. In this paper, we continue this study improving some optimization problems and extending some results to the context of quasi-Banach spaces.
Recently posted
-
The approximate solution of the general split variational inequality problem by intermixed iteration
-
Collectively coincidence results for lower semicontinuous multifunctions in locally convex spaces
-
Second-order necessary conditions for bilevel programs via KKT reformulation
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods