AGAndrea García

Andrea García

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Andrea García has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Convergence Analysis of Greedy Algorithms with Adaptive Relaxation in Hilbert Spaces

    by Pablo M. Berná, 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.

  • Open Access

    Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces

    by Miguel Berasategui, Pablo M. Berná, Hung Viet Chu, 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].

  • Top Cited Papers
    Open Access

    Greedy algorithms: a review and open problems

    by 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.


  • Open Access

    A note on 1-semi-greedy bases in p-Banach spaces with 0 < p ≤ 1

    by Pablo M. Berná, Andrea García, 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.