DeepAI AI Chat
Log In Sign Up

Fast randomized entropically regularized semidefinite programming

by   Michael Lindsey, et al.
berkeley college

We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a carefully chosen randomized trace estimator can be used to estimate dual gradients effectively. We also introduce specialized optimization approaches for common SDP, specifically SDP with diagonal constraint and the problem of the determining the spectral projector onto the span of extremal eigenvectors. We validate our approach on such problems with applications to combinatorial optimization and spectral embedding.


page 1

page 2

page 3

page 4


Low-rank semidefinite programming for the MAX2SAT problem

This paper proposes a new algorithm for solving MAX2SAT problems based o...

A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming

In semidefinite programming the dual may fail to attain its optimal valu...

A Fast Semidefinite Approach to Solving Binary Quadratic Problems

Many computer vision problems can be formulated as binary quadratic prog...

Fast semidefinite programming with feedforward neural networks

Semidefinite programming is an important optimization task, often used i...

HDSDP: Software for Semidefinite Programming

HDSDP is a numerical software solving the semidefinite programming probl...

Variational Quantum Algorithms for Semidefinite Programming

A semidefinite program (SDP) is a particular kind of convex optimization...

Strongly refuting all semi-random Boolean CSPs

We give an efficient algorithm to strongly refute semi-random instances ...