Corpus ID: 67877060

An $\widetilde\mathcalO(m/\varepsilon^3.5)$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints

  title={An \$\widetilde\mathcalO(m/\varepsilon^3.5)\$-Cost Algorithm for Semidefinite Programs with Diagonal Constraints},
  author={Y. Lee and Swati Padmanabhan},
  • Y. Lee, Swati Padmanabhan
  • Published in COLT 2020
  • Mathematics, Computer Science
  • We study semidefinite programs with diagonal constraints. This problem class appears in combinatorial optimization and has a wide range of engineering applications such as in circuit design, channel assignment in wireless networks, phase recovery, covariance matrix estimation, and low-order controller design. In this paper, we give an algorithm to solve this problem to $\varepsilon$-accuracy, with a run time of $\widetilde{\mathcal{O}}(m/\varepsilon^{3.5})$, where $m$ is the number of non-zero… CONTINUE READING
    2 Citations
    Riemannian Langevin Algorithm for Solving Semidefinite Programs
    • 1
    • PDF


    Phase recovery, MaxCut and complex semidefinite programming
    • 442
    • PDF
    Max-Cut based overlapping channel assignment for 802.11 multi-radio wireless mesh networks
    • Weiqi Wang, Bo Liu, Ming Yang, Junzhou Luo, X. Shen
    • Computer Science
    • Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD)
    • 2013
    • 2
    Rank minimization and applications in system theory
    • 220
    • PDF
    Minimizing finite sums with the stochastic average gradient
    • 786
    • PDF
    A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization
    • 166
    • PDF
    Sparse convex optimization methods for machine learning
    • 72
    • PDF
    Primal-dual subgradient methods for convex problems
    • Y. Nesterov
    • Mathematics, Computer Science
    • Math. Program.
    • 2009
    • 694
    • PDF