This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.
Original paper

A Faster Interior Point Method for Semidefinite Programming

Pages: 910 - 918
Published: Nov 1, 2020
Abstract
Semidefinite programs (SDPs) are a fundamental class of optimization problems with important recent applications in approximation algorithms, quantum complexity, robust learning, algorithmic rounding, and adversarial deep learning. This paper presents a faster interior point method to solve generic SDPs with variable size n ×n and m constraints in time Õ(√n(mn
Paper Details
Title
A Faster Interior Point Method for Semidefinite Programming
Published Date
Nov 1, 2020
Pages
910 - 918
© 2025 Pluto Labs All rights reserved.
Step 1. Scroll down for details & analytics related to the paper.
Discover a range of citation analytics, paper references, a list of cited papers, and more.