Convex

Results: 2611



#Item
71Generalized Line Spectral Estimation via Convex Optimization Reinhard Heckel∗ and Mahdi Soltanolkotabi† September 26, 2016 Abstract Line spectral estimation is the problem of recovering the frequencies and amplitudes

Generalized Line Spectral Estimation via Convex Optimization Reinhard Heckel∗ and Mahdi Soltanolkotabi† September 26, 2016 Abstract Line spectral estimation is the problem of recovering the frequencies and amplitudes

Add to Reading List

Source URL: www.reinhardheckel.com

- Date: 2018-02-26 16:53:33
    72Convex Optimization M2 Lecture 8 A. d’Aspremont. Convex Optimization M2

    Convex Optimization M2 Lecture 8 A. d’Aspremont. Convex Optimization M2

    Add to Reading List

    Source URL: www.di.ens.fr

      73Input Convex Neural Networks

      Input Convex Neural Networks

      Add to Reading List

      Source URL: proceedings.mlr.press

      - Date: 2018-02-06 15:06:57
        74Supplement to “A Semismooth Newton Method for Fast, Generic Convex Programming” Alnur Ali * 1 Eric Wong * 1 J. Zico Kolter 2  This document contains proofs and supplementary details for the paper “A Semismooth Newt

        Supplement to “A Semismooth Newton Method for Fast, Generic Convex Programming” Alnur Ali * 1 Eric Wong * 1 J. Zico Kolter 2 This document contains proofs and supplementary details for the paper “A Semismooth Newt

        Add to Reading List

        Source URL: proceedings.mlr.press

        - Date: 2018-02-06 15:06:57
          75Convex Optimization M2 Lecture 6 A. d’Aspremont. Convex Optimization M2

          Convex Optimization M2 Lecture 6 A. d’Aspremont. Convex Optimization M2

          Add to Reading List

          Source URL: www.di.ens.fr

            76Convex Optimization M2 Lecture 2 A. d’Aspremont. Convex Optimization M2

            Convex Optimization M2 Lecture 2 A. d’Aspremont. Convex Optimization M2

            Add to Reading List

            Source URL: www.di.ens.fr

              77Convex Optimization Exam, NovemberYou have three hours. You may use a single double-sided page of notes. Please keep your answers as concise as possible. Exercise 1 (Duality) Derive the dual of the following LP mi

              Convex Optimization Exam, NovemberYou have three hours. You may use a single double-sided page of notes. Please keep your answers as concise as possible. Exercise 1 (Duality) Derive the dual of the following LP mi

              Add to Reading List

              Source URL: www.di.ens.fr

                78Convex Relaxations for Permutation Problems  Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

                Convex Relaxations for Permutation Problems Alex d’Aspremont, CNRS & ENS, Paris. with Fajwel Fogel, Rodolphe Jenatton & Francis Bach, INRIA & ENS Paris.

                Add to Reading List

                Source URL: www.di.ens.fr

                  792016 29th SIBGRAPI Conference on Graphics, Patterns and Images  Convex Hull for Probabilistic Points F. Betul Atalay  Sorelle A. Friedler

                  2016 29th SIBGRAPI Conference on Graphics, Patterns and Images Convex Hull for Probabilistic Points F. Betul Atalay Sorelle A. Friedler

                  Add to Reading List

                  Source URL: sorelle.friedler.net

                  - Date: 2016-10-18 12:43:32
                    80Input-Convex Deep Networks

                    Input-Convex Deep Networks

                    Add to Reading List

                    Source URL: bamos.github.io

                    - Date: 2018-02-27 11:04:11