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 81 articles , 1 standard article )
Showing results 1 to 20 of 81.
Sorted by year (- Bhaskar, Sonia A.: Probabilistic low-rank matrix completion from quantized measurements (2016)
- Lan, Guanghui; Monteiro, Renato D.C.: Iteration-complexity of first-order augmented Lagrangian methods for convex programming (2016)
- Mishra, Bamdev; Sepulchre, Rodolphe: Riemannian preconditioning (2016)
- Shtern, Shimrit; Ben-Tal, Aharon: Computational methods for solving nonconvex block-separable constrained quadratic problems (2016)
- Bahmani, Sohail; Romberg, Justin: Lifting for blind deconvolution in random mask imaging: identifiability and convex relaxation (2015)
- Chaudhury, K.N.; Khoo, Y.; Singer, A.: Global registration of multiple point clouds using semidefinite programming (2015)
- Zhu, Xiaojing: Computing the nearest low-rank correlation matrix by a simplified SQP algorithm (2015)
- Burer, Samuel; Kim, Sunyoung; Kojima, Masakazu: Faster, but weaker, relaxations for quadratically constrained quadratic programs (2014)
- Fages, Jean-Guillaume; Lapègue, Tanguy: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (2014)
- Huang, Aiqun; Xu, Chengxian: A trust region method for solving semidefinite programs (2013)
- Wen, Zaiwen; Yin, Wotao: A feasible method for optimization with orthogonality constraints (2013)
- Bomze, Immanuel M.; Grippo, Luigi; Palagi, Laura: Unconstrained formulation of standard quadratic optimization problems (2012)
- Grippo, Luigi; Palagi, Laura; Piacentini, Mauro; Piccialli, Veronica; Rinaldi, Giovanni: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (2012)
- Liu, Yong-Jin; Sun, Defeng; Toh, Kim-Chuan: An implementable proximal point algorithmic framework for nuclear norm minimization (2012)
- Lu, Zhaosong; Zhang, Yong: An augmented Lagrangian approach for sparse principal component analysis (2012)
- Malick, Jér^ome; Roupin, Frédéric: Solving $k$-cluster problems to optimality with semidefinite programming (2012)
- Mitchell, John E.; Pang, Jong-Shi; Yu, Bin: Obtaining tighter relaxations of mathematical programs with complementarity constraints (2012)
- Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
- Nie, Jiawang; Wang, Li: Regularization methods for SDP relaxations in large-scale polynomial optimization (2012)
- Palagi, Laura; Piccialli, Veronica; Rendl, Franz; Rinaldi, Giovanni; Wiegele, Angelika: Computational approaches to MAX-cut (2012)