Scalable low-rank semidefinite programming for certifiably correct machine perception
DOI10.1007/978-3-030-66723-8_33zbMATH Open1469.68133OpenAlexW3128885578MaRDI QIDQ3382007FDOQ3382007
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
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
Semidefinite programming (90C22) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Title not available (Why is that?)
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semidefinite Programming
- Trust Region Methods
- Semidefinite optimization
- On block diagonal and Schur complement preconditioning
- Local minima and convergence in low-rank semidefinite programming
- Title not available (Why is that?)
- Feedback systems: an introduction for scientists and engineers.
- On LICQ and the uniqueness of Lagrange multipliers
- Low-rank optimization on the cone of positive semidefinite matrices
- A note on probably certifiably correct algorithms
Cited In (2)
Uses Software
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)
