3 code implementations • 6 Jun 2015 • V. Jeyakumar, J. B. Lasserre, G. Li, T. S. Pham
Our scheme for problems with a convex lower-level problem involves solving a transformed equivalent single-level problem by a sequence of SDP relaxations; whereas our approach for general problems involving a non-convex polynomial lower-level problem solves a sequence of approximation problems via another sequence of SDP relaxations.
Optimization and Control
1 code implementation • 9 Feb 2015 • Y. de Castro, F Gamboa, D Henrion, J. B. Lasserre
We investigate the multi-dimensional Super Resolution problem on closed semi-algebraic domains for various sampling schemes such as Fourier or moments.
Information Theory Information Theory Optimization and Control Computation
