Skip to Main content Skip to Navigation

Convex and Spectral Relaxations for Phase Retrieval, Seriation and Ranking

Fajwel Fogel 1, 2 
2 SIERRA - Statistical Machine Learning and Parsimony
DI-ENS - Département d'informatique - ENS Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR8548
Abstract : Optimization is often the computational bottleneck in disciplines such as statistics, biology, physics, finance or economics. Many optimization problems can be directly cast in the well- studied convex optimization framework. For non-convex problems, it is often possible to derive convex or spectral relaxations, i.e., derive approximations schemes using spectral or convex optimization tools. Convex and spectral relaxations usually provide guarantees on the quality of the retrieved solutions, which often transcribes in better performance and robustness in practical applications, compared to naive greedy schemes. In this thesis, we focus on the problems of phase retrieval, seriation and ranking from pairwise comparisons. For each of these combinatorial problems we formulate convex and spectral relaxations that are robust, flexible and scalable.
Complete list of metadata

Cited literature [131 references]  Display  Hide  Download
Contributor : Fajwel Fogel Connect in order to contact the contributor
Submitted on : Monday, February 1, 2016 - 5:21:21 PM
Last modification on : Thursday, March 17, 2022 - 10:08:44 AM
Long-term archiving on: : Saturday, November 12, 2016 - 12:02:01 AM



Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License


  • HAL Id : tel-01265606, version 1


Fajwel Fogel. Convex and Spectral Relaxations for Phase Retrieval, Seriation and Ranking. Optimization and Control [math.OC]. Ecole Doctorale de l'Ecole Polytechnique, 2015. English. ⟨tel-01265606⟩



Record views


Files downloads