We give an explicit construction of an almost greedy basis of L¹(0,1), complementing the results on existence of such a basis. The basis is described in terms of the Haar basis. We construct a ...

This is a preview. Log in through your library . Abstract A greedy algorithm solves a dual pair of linear programs where the primal variables are associated to the elements of a sublattice B of a ...