Rational Optimization for Nonlinear Reconstruction with Approximate $\ell_0$ Penalization
Marc Castella, Jean-Christophe Pesquet, Arthur Marmin

TL;DR
This paper introduces a global optimization framework for nonlinear signal reconstruction using rational approximation of the $ ext{l}_0$ pseudo-norm, employing semidefinite programming relaxations to handle sparsity and nonlinearity effectively.
Contribution
It develops a novel method combining rational approximation, semi-algebraic functions, and sparse semidefinite relaxations for globally optimal nonlinear signal reconstruction.
Findings
Effective handling of nonlinear models with rational saturation.
Scalable relaxation method for hundreds of variables.
Outperforms naive linearization approaches.
Abstract
Recovering nonlinearly degraded signal in the presence of noise is a challenging problem. In this work, this problem is tackled by minimizing the sum of a non convex least-squares fit criterion and a penalty term. We assume that the nonlinearity of the model can be accounted for by a rational function. In addition, we suppose that the signal to be sought is sparse and a rational approximation of the pseudo-norm thus constitutes a suitable penalization. The resulting composite cost function belongs to the broad class of semi-algebraic functions. To find a globally optimal solution to such an optimization problem, it can be transformed into a generalized moment problem, for which a hierarchy of semidefinite programming relaxations can be built. Global optimality comes at the expense of an increased dimension and, to overcome computational limitations concerning the number of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
