In this paper, we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in Dilworth et al. (Constr Approx 19:575–597, 2003) for Schauder bases. We also give a characterization of 1-strong partial greediness, following the study started in Albiac and Ansorena (Rev Matem Compl 30(1):13–24, 2017), Albiac and Wojtaszczyk (J Approx Theory 138:65–86, 2006).

在本文中，我们继续研究贪婪算法的Lebesgue型不等式。我们介绍了强局部贪婪的Markushevich基的概念，并研究了与它们相关的Lebesgue型参数。我们证明了该性质等同于保守和准贪婪的性质，扩展了Dilworth等人给出的类似结果。（Constr约19：575–597，2003年）适用于Schauder基地。在Albiac和Ansorena（Rev Matem Compl 30（1）：13-24，2017），Albiac和Wojtaszczyk（J Approx Theory 138：65-86，2006）开始研究之后，我们还给出了1个强烈的部分贪婪的特征。 ）。