Frank-Wolfe Algorithm for the Exact Sparse Problem

Abstract : In this paper, we study the properties of the Frank-Wolfe algorithm to solve the \ExactSparse reconstruction problem. We prove that when the dictionary is quasi-incoherent, at each iteration, the Frank-Wolfe algorithm picks up an atom indexed by the support. We also prove that when the dictionary is quasi-incoherent, there exists an iteration beyond which the algorithm converges exponentially fast.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01881329
Contributor : Valentin Emiya <>
Submitted on : Monday, December 17, 2018 - 1:58:41 PM
Last modification on : Monday, March 4, 2019 - 2:04:22 PM
Long-term archiving on : Monday, March 18, 2019 - 3:47:47 PM

Files

itwist18.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01881329, version 1
  • ARXIV : 1812.07201

Citation

Farah Cherfaoui, Valentin Emiya, Liva Ralaivola, Sandrine Anthoine. Frank-Wolfe Algorithm for the Exact Sparse Problem. iTWIST: international Traveling Workshop on Interactions between low-complexity data models and Sensing Techniques, Nov 2018, Marseille, France. ⟨hal-01881329⟩

Share

Metrics

Record views

167

Files downloads

53