S
Samuel Burer
Researcher at University of Iowa
Publications - 72
Citations - 4979
Samuel Burer is an academic researcher from University of Iowa. The author has contributed to research in topics: Semidefinite programming & Quadratically constrained quadratic program. The author has an hindex of 29, co-authored 69 publications receiving 4310 citations. Previous affiliations of Samuel Burer include Georgia Institute of Technology.
Papers
More filters
Journal ArticleDOI
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
TL;DR: A nonlinear programming algorithm for solving semidefinite programs (SDPs) in standard form that replaces the symmetric, positive semideFinite variable X with a rectangular variable R according to the factorization X=RRT.
Journal ArticleDOI
Non-convex mixed-integer nonlinear programming: A survey
Samuel Burer,Adam N. Letchford +1 more
TL;DR: In this paper, the authors survey the literature on non-convex mixed-integer nonlinear programs, discussing applications, algorithms, and software, and special attention is paid to the case in which the objective and constraint functions are quadratic.
Journal ArticleDOI
Local Minima and Convergence in Low-Rank Semidefinite Programming
TL;DR: The local minima of LRSDPr are classified and the optimal convergence of a slight variant of the successful, yet experimental, algorithm of Burer and Monteiro is proved, which handles L RSDPr via the nonconvex change of variables X=RRT.
Journal ArticleDOI
On the copositive representation of binary and continuous nonconvex quadratic programs
TL;DR: Any nonconvex quadratic program having a mix of binary and continuous variables as a linear program over the dual of the cone of copositive matrices is model, which reduces the dimension of the linear conic program.
Journal ArticleDOI
Ensemble Pruning Via Semi-definite Programming
TL;DR: By applying semi-definite programming (SDP) as a solution technique, the ensemble subset selection problem is formulated as a quadratic integer programming problem and the SDP-based pruning algorithm outperforms other heuristics in the literature.