Optimization Online


Exact solutions to Super Resolution on semi-algebraic domains in higher dimensions

Yohann de Castro(yohann.decastro***at***math.u-psud.fr)
Fabrice Gamboa(fabrice.gamboa***at***math.univ-toulouse.fr)
Didier Henrion(henrion***at***laas.fr)
Jean-Bernard Lasserre(lasserre***at***laas.fr)

Abstract: We investigate the multi-dimensional Super Resolution problem on closed semi-algebraic domains for various sampling schemes such as Fourier or moments. We present a new semidefinite programming (SDP) formulation of the l1-minimization in the space of Radon measures in the multi-dimensional frame on semi-algebraic sets. While standard approaches have focused on SDP relaxations of the dual program (a popular approach is based on Gram matrix representations), this paper introduces an exact formulation of the primal l1-minimization exact recovery problem of Super Resolution that unleashes standard techniques (such as moment-sum-of-squares hierarchies) to overcome intrinsic limitations of previous works in the literature. Notably, we show that one can exactly solve the Super Resolution problem in dimension greater than 2 and for a large family of domains described by semi-algebraic sets.

Keywords: super resolution; signed measure; semidefinite programming; total variation; semialgebraic domain

Category 1: Applications -- Science and Engineering (Statistics )

Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )


Download: [PDF]

Entry Submitted: 02/09/2015
Entry Accepted: 02/09/2015
Entry Last Modified: 02/09/2015

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society