Andrea García

Mrs. Andrea García


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 February 2025 in Journal of Inequalities and Applications
Verified
Journal Article
Open access
PDF file
AGAndrea García
Andrea García
Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm in the context of dictionaries in Hilbert spaces, analyzing the optimality of the definition of this algorithm. Next, we provide a general overview of the thresholding greedy algorithm and the Chebyshev thresholding greedy algorithm, with particular attention to their applications to bases in p-Banach spaces with $0< p\leq 1$ 0 < p ≤ 1 . In both cases, we conclude by posing several questions for future research.

1 January 2024 in Demonstratio Mathematica
Verified
Journal Article
Open access
PDF file
PBPablo Berná
Pablo Berná
AGAndrea García
Andrea García
DGDavid González
David González
The purpose of this article is to discuss about the so-called semi-greedy bases in p -Banach spaces. Specifically, we will review existing results that characterize these bases in terms of almost-greedy bases, and, also, we analyze quantitatively the behavior of certain constants. As new results, by avoiding the use of certain classical results in p -convexity, we aim to quantitatively improve specific bounds for bi-monotone 1-semi-greedy bases.

27 August 2025 in arXiv
Verified
Preprint
Open access
PDF file
MBMiguel Berasategui
Miguel Berasategui
PBPablo Berná
Pablo Berná
HCHung Viet Chu
Hung Viet Chu
AGAndrea García
Andrea García
We continue the study of Lebesgue-type parameters for various greedy algorithms in quasi-Banach spaces. First, we introduce a parameter that can be used with the quasi-greedy parameter to obtain the exact growth of the Lebesgue parameter for strong partially greedy bases. Second, we establish a new upper bound for the Lebesgue parameter for semi-greedy bases using the quasi-greedy and the squeeze symmetry parameters. Finally, we answer several open questions regarding the optimal power in various bounds proved in [F. Albiac, J. L. Ansorena, and P. M. Berná, New parameters and Lebesgue-type estimates in greedy approximation, Forum Math. Sigma 10 (2022), 1-39].

1 February 2026 in arXiv
Verified
Preprint
Open access
PDF file
PBPablo Berná
Pablo Berná
AGAndrea García
Andrea García
The Power-Relaxed Greedy Algorithm (PRGA) was introduced as a generalization of the so called Relaxed Greedy Algorithm, introduced by DeVore and Temlyakov, by replacing the relaxation parameter $1/m$ with $1/m^α$, with the aim of improving convergence rates. While the case $α\le 1$ is well understood, the behavior of the algorithm for $α>1$ remained an open problem. In this work, we answer this question and, moreover, we introduce a relaxed greedy algorithm with an optimal step size chosen by exact line search at each iteration.