Variations of Greedy Algorithm What is the definition of an "orthogonal greedy algorithm"?

What is the definition of a "relaxed greedy algorithms"?

Can you give an example to illustrate how these notions differ from ordinary greedy algorithms?

Wikipedia's article on greedy algorithms says:


  There are a few variations to the greedy algorithm:
  
  
  Pure greedy algorithms
  Orthogonal greedy algorithms
  Relaxed greedy algorithms
  


Wikipedia does not explain further or provide any examples, so it's not clear what the Wikipedia article is referring to.
I have no clue what these various types are. You might want to ask the Wikipedia author who added these types, Wleizero. I can add to the list other types, such as double greedy algorithms, randomized greedy algorithms, reverse delete algorithms, and probably many more.

There are several frameworks for greedy algorithms which might interest you, for example priority algorithms studied by Allan Borodin and his coauthors. However, a laundry list of algorithms does not make a classification. I suggest you just ignore this list of types.