v1v2 (latest)

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

SIAM Journal on Optimization (SIOPT), 2019

9 February 2019

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

10 / 10 papers shown

Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+

Yufan Huang

D. Gleich

189

14 Jun 2024

Fast, Scalable, Warm-Start Semidefinite Programming with Spectral Bundling and Sketching

Rico Angell

Andrew McCallum

433

19 Dec 2023

Provably Faster Gradient Descent via Long StepsSIAM Journal on Optimization (SIOPT), 2023

Benjamin Grimmer

366

12 Jul 2023

Learning Transition Operators From Sparse Space-Time SamplesIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2022

C. Kümmerle

Mauro Maggioni

Sui Tang

174

01 Dec 2022

Lecture notes on non-convex algorithms for low-rank matrix recovery

Irène Waldspurger

224

21 May 2021

Enabling certification of verification-agnostic networks via memory-efficient semidefinite programming

Sumanth Dathathri

Krishnamurthy Dvijotham

...

431

100

22 Oct 2020

Learning Dynamical Systems with Side Information

Amir Ali Ahmadi

Bachir El Khadir

312

23 Aug 2020

On the simplicity and conditioning of low rank semidefinite programsSIAM Journal on Optimization (SIOPT), 2020

Lijun Ding

Madeleine Udell

484

25 Feb 2020

Bundle Method Sketching for Low Rank Semidefinite Programming

Lijun Ding

Benjamin Grimmer

224

11 Nov 2019

A Survey of Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics

Anirudha Majumdar

G. Hall

Amir Ali Ahmadi

362

115

14 Aug 2019