This paper focuses on the noisy demixing problem for robust recovery of a sequence of source signals and impulse responses from a sum of their convolution with additional noise. There are two main prevalent paradigms for this nonconvex estimation problem. One is leveraging the convex relaxation approach to provide good theoretical sample complexity guarantees. Another one is based on the nonconvex optimization method to enjoy good computational complexity. However, both methods are explored separately at this stage. Instead, we shall develop a method bridging convex relaxation with nonconvex optimization in a rigorous theoretical way. In fact, we find that the solution of the convex relaxation approach and the critical point of nonconvex optimization method can be almost the same. Based on our work, the good theoretical sample complexity guarantee of convex relaxation approach can be applied to nonconvex optimization method. And on the other hand, the certain stability guarantees from nonconvex optimization method can be propagated to convex relaxation approach.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Noisy Demixing: Convex Relaxation Meets Nonconvex Optimization


    Contributors:


    Publication date :

    2020-11-01


    Size :

    684136 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English






    Monocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods

    Brunet, F. / Bartoli, A. / Hartley, R. I. | British Library Online Contents | 2014


    Shape Optimization of Hypersonic Lifting Vehicles Via Convex Relaxation

    Berkenstock, Daniel / Alonso, Juan J. / Lessard, Lauren | AIAA | 2023