Random projections for conic programs

01/11/2021

∙

We discuss the application of random projections to conic programming: notably linear, second-order and semidefinite programs. We prove general approximation results on feasibility and optimality using the framework of formally real Jordan algebras. We then discuss some computational experiments on randomly generated semidefinite programs in order to illustrate the practical applicability of our ideas

READ FULL TEXT

Random projections for conic programs

Staging Human-computer Dialogs: An Application of the Futamura Projections

Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem

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

An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone

Gaussian random projections of convex cones: approximate kinematic formulae and applications

Randomized Sketches of Convex Programs with Sharp Guarantees

Random projections for conic programs

Related Research

Staging Human-computer Dialogs: An Application of the Futamura Projections

Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem

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

An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone

Gaussian random projections of convex cones: approximate kinematic formulae and applications

Randomized Sketches of Convex Programs with Sharp Guarantees