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
-
Two-step inertial viscosity subgradient extragradient algorithm with self-adaptive step sizes for solving pseudomonotone equilibrium problems
-
On a wave equation with mixed dynamic boundary conditions
-
Algorithmic and Analytical Approach for a System of Generalized Multi-valued Resolvent Equations – Part II: Algorithms and Convergence
-
Fixed points vs best proximity points and a contraction map sets with an external factor
-
Semi-exponential Post-Widder operators
-
Optimal solutions of minimization problems via new best proximity point results on quasi metric spaces
-
On the geometry of diffeological vector pseudobundles and infinite dimensional vector bundles: automorphisms, connections and covariant derivatives
-
Naturally ordered transformation semigroups preserving an equivalence relation on an invariant set
-
Existence and stability results for multi-term fractional delay differential equations equipped with nonlocal multi-point and multi-strip boundary conditions
-
The approximate solution of the general split variational inequality problem by intermixed iteration