An Optimal-Storage Approach to Semidefinite Programming using
Approximate Complementarity

v1v2 (latest)

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

9 February 2019

Madeleine Udell

ArXiv (abs)PDF HTML

Papers citing "An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity"

6 / 6 papers shown

Title
Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching Rico Angell Andrew McCallum 105 2 0 19 Dec 2023
Learning Transition Operators From Sparse Space-Time Samples C. Kümmerle Mauro Maggioni Sui Tang 57 1 0 01 Dec 2022
Lecture notes on non-convex algorithms for low-rank matrix recovery Irène Waldspurger 58 1 0 21 May 2021
Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming Sumanth Dathathri Krishnamurthy Dvijotham Alexey Kurakin Aditi Raghunathan J. Uesato ... Shreya Shankar Jacob Steinhardt Ian Goodfellow Percy Liang Pushmeet Kohli AAML 107 95 0 22 Oct 2020
Learning Dynamical Systems with Side Information Amir Ali Ahmadi Bachir El Khadir 45 49 0 23 Aug 2020
A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics Anirudha Majumdar G. Hall Amir Ali Ahmadi 115 102 0 14 Aug 2019