Now showing items 1-2 of 2

    • ADMM for SDP Relaxation of GP 

      Sun, Hao (University of Waterloo, 2016-08-30)
      We consider the problem of partitioning the set of nodes of a graph G into k sets of given sizes in order to minimize the cut obtained after removing the k-th set. This is a variant of the well-known vertex separator ...
    • Semidefinite Programming Relaxations of the Simplified Wasserstein Barycenter Problem: An ADMM Approach 

      Cheng, Jiahui (University of Waterloo, 2023-05-04)
      The Simplified Wasserstein Barycenter problem, the problem of picking k points each chosen from a distinct set of n points as to minimize the sum of distances to their barycenter, finds applications in various areas of ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages