5. Greedy Algorithms

By Masaaki Nagahara, The University of Kitakyushu, Japan, nagahara@kitakyu-u.ac.jp

Downloaded: 690 times

Published: 24 Sep 2020

© 2020 Masaaki Nagahara

Abstract

In the previous chapter, we have formulated the problem of sparse representation as optimization problems with ℓ1 norm, for which there are efficient and fast algorithms. The idea was to approximate the non-convex and discontinuous ℓ0 norm by the convex ℓ1 norm. In this chapter, we consider alternative algorithms that directly solve the ℓ0-norm optimization by using the greedy method.