SDPLR
SDPLR is an ANSI C package developed S. Burer, C. Choi and R.D.C. Monteiro for solving general semidefinite programs (SDPs) using a nonlinear, first-order algorithm that is based on the idea of low-rank factorization. A specialized version of SDPLR is also available for solving specially structured semidefinite programs (SDPs) such as the MaxCut SDP, the Minimum Bisection SDP, and the (unweighted) Lovasz Theta SDP. The details of the algorithm used by SDPLR can be found in the technical report ”A Nonlinear Programming Algorithm for Semidefinite Programs via Low-rank Factorization” written by S. Burer and R.D.C. Monteiro.
Keywords for this software
References in zbMATH (referenced in 111 articles , 1 standard article )
Showing results 1 to 20 of 111.
Sorted by year (- Chrétien, Stéphane; Clarkson, Paul: A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids (2020)
- Duan, Yaqi; Wang, Mengdi; Wen, Zaiwen; Yuan, Yaxiang: Adaptive low-nonnegative-rank approximation for state aggregation of Markov chains (2020)
- Eftekhari, Armin; Hauser, Raphael A.: Principal component analysis by optimization of symmetric functions has no spurious local optima (2020)
- Gao, Wenbo; Goldfarb, Donald; Curtis, Frank E.: ADMM for multiaffine constrained optimization (2020)
- Li, Xiao; Zhu, Zhihui; Man-Cho So, Anthony; Vidal, René: Nonconvex robust low-rank matrix recovery (2020)
- Li, Xinrong; Xiu, Naihua; Zhou, Shenglong: Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (2020)
- Yu, Ming; Gupta, Varun; Kolar, Mladen: Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (2020)
- Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
- Campos, Juan S.; Misener, Ruth; Parpas, Panos: A multilevel analysis of the Lasserre hierarchy (2019)
- Ling, Shuyang; Xu, Ruitu; Bandeira, Afonso S.: On the landscape of synchronization networks: a perspective from nonconvex optimization (2019)
- Nayak, Rupaj Kumar; Mohanty, Nirmalya Kumar: Improved row-by-row method for binary quadratic optimization problems (2019)
- Amini, Arash A.; Levina, Elizaveta: On semidefinite relaxations for the block model (2018)
- Bonami, Pierre; Günlük, Oktay; Linderoth, Jeff: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (2018)
- de Santis, Marianna; Rendl, Franz; Wiegele, Angelika: Using a factored dual in augmented Lagrangian methods for semidefinite programming (2018)
- Huang, Wen; Hand, Paul: Blind deconvolution by a steepest descent algorithm on a quotient manifold (2018)
- Lourenço, Bruno F.; Fukuda, Ellen H.; Fukushima, Masao: Optimality conditions for nonlinear semidefinite programming via squared slack variables (2018)
- Lourenço, Bruno F.; Fukuda, Ellen H.; Fukushima, Masao: Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method (2018)
- Park, Dohyung; Kyrillidis, Anastasios; Caramanis, Constantine; Sanghavi, Sujay: Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably (2018)
- Vandaele, Arnaud; Glineur, François; Gillis, Nicolas: Algorithms for positive semidefinite factorization (2018)
- Zhang, Teng; Yang, Yi: Robust PCA by manifold optimization (2018)