Scalable low-rank semidefinite programming for certifiably correct machine perception

DOI10.1007/978-3-030-66723-8_33MaRDI QIDQ3382007zbMATH OpenOpenAlexFDO

Authors David M. Rosen

Publication date 20 September 2021

Published in Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-66723-8_33

Mathematics Subject Classification ID

Semidefinite programming (90C22) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Recommendations

• Scalable semidefinite programming
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• A low complexity semidefinite relaxation for large-scale MIMO detection
• A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
• Phase transitions in semidefinite relaxations

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 870530 (Why is no real title available?)
• scientific article; zbMATH DE number 5223994 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A note on probably certifiably correct algorithms
• Feedback systems: an introduction for scientists and engineers.
• Local minima and convergence in low-rank semidefinite programming
• Low-rank optimization on the cone of positive semidefinite matrices
• On LICQ and the uniqueness of Lagrange multipliers
• On block diagonal and Schur complement preconditioning
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Semidefinite Programming
• Semidefinite optimization
• Trust Region Methods
• Variational Analysis

Cited in

(2)

• Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization

Describes a project that uses

Uses Software

• SE-Sync
• iSAM2
• g2o
• Ipopt
• SDPLR

This page was built for publication: Scalable low-rank semidefinite programming for certifiably correct machine perception

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3382007)