New algorithmic approaches for semidefinite programming with applications to combinatorial optimization. - Samuel Burer (2001)

Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Comput. Optim. Appl., 2002)

Solving a class of semidefinite programs via nonlinear programming. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2002)

Maximum stable set formulations and heuristics based on continuous optimization. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2002)

Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (SIAM J. Optim., 2002)

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. - Samuel Burer; Renato D. C. Monteiro (Math. Program., 2003)

A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs. - Samuel Burer; Renato D. C. Monteiro; Yin Zhang 010 (Math. Program., 2003)

A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. - Samuel Burer; Renato D. C. Monteiro (Optim. Methods Softw., 2003)

Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices. - Samuel Burer (SIAM J. Optim., 2003)

Sharing Classifiers among Ensembles from Related Problem Domains. - Yi Zhang 006; W. Nick Street; Samuel Burer (ICDM, 2005)

D.C. Versus Copositive Bounds for Standard QP. - Kurt M. Anstreicher; Samuel Burer (J. Glob. Optim., 2005)

Local Minima and Convergence in Low-Rank Semidefinite Programming. - Samuel Burer; Renato D. C. Monteiro (Math. Program., 2005)

Ensemble Pruning Via Semi-definite Programming. - Yi Zhang 006; Samuel Burer; W. Nick Street (J. Mach. Learn. Res., 2006)

Computational enhancements in low-rank semidefinite programming. - Samuel Burer; Changhui Choi (Optim. Methods Softw., 2006)

Solving Lift-and-Project Relaxations of Binary Integer Programs. - Samuel Burer; Dieter Vandenbussche (SIAM J. Optim., 2006)

Solving maximum-entropy sampling problems using factored masks. - Samuel Burer; Jon Lee 001 (Math. Program., 2007)

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization. - Miguel F. Anjos; Samuel Burer (SIAM J. Optim., 2007)

Coordinating the supply chain in the agricultural seed industry. - Samuel Burer; Philip C. Jones; Timothy J. Lowe (Eur. J. Oper. Res., 2008)

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. - Samuel Burer; Dieter Vandenbussche (Math. Program., 2008)

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. - Samuel Burer; Dieter Vandenbussche (Comput. Optim. Appl., 2009)

On the copositive representation of binary and continuous nonconvex quadratic programs. - Samuel Burer (Math. Program., 2009)

A p-cone sequential relaxation procedure for 0-1 integer programs. - Samuel Burer; Jieqiu Chen (Optim. Methods Softw., 2009)

On Nonconvex Quadratic Programming with Box Constraints. - Samuel Burer; Adam N. Letchford (SIAM J. Optim., 2009)

Computable representations for convex hulls of low-dimensional quadratic forms. - Kurt M. Anstreicher; Samuel Burer (Math. Program., 2010)

Optimizing a polyhedral-semidefinite relaxation of completely positive programs. - Samuel Burer (Math. Program. Comput., 2010)

Relaxing the optimality conditions of box QP. - Samuel Burer; Jieqiu Chen (Comput. Optim. Appl., 2011)

Globally solving nonconvex quadratic programming problems via completely positive programming. - Jieqiu Chen; Samuel Burer (Math. Program. Comput., 2012)

Representing quadratically constrained quadratic programs as generalized copositive programs. - Samuel Burer; Hongbo Dong 001 (Oper. Res. Lett., 2012)

Separation and relaxation for cones of quadratic forms. - Samuel Burer; Hongbo Dong 001 (Math. Program., 2013)

Second-Order-Cone Constraints for Extended Trust-Region Subproblems. - Samuel Burer; Kurt M. Anstreicher (SIAM J. Optim., 2013)

Faster, but weaker, relaxations for quadratically constrained quadratic programs. - Samuel Burer; Sunyoung Kim; Masakazu Kojima (Comput. Optim. Appl., 2014)

Unbounded convex sets for non-convex mixed-integer quadratic programming. - Samuel Burer; Adam N. Letchford (Math. Program., 2014)

A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs. - Jieqiu Chen; Samuel Burer (SIAM J. Optim., 2014)

A gentle, geometric introduction to copositive optimization. - Samuel Burer (Math. Program., 2015)

The trust region subproblem with non-intersecting linear constraints. - Samuel Burer; Boshi Yang (Math. Program., 2015)

A Two-Variable Approach to the Two-Trust-Region Subproblem. - Boshi Yang; Samuel Burer (SIAM J. Optim., 2016)

Editorial. - Alper Atamtürk; Sam Burer (Discret. Optim., 2017)

How to convexify the intersection of a second order cone and a nonconvex quadratic. - Samuel Burer; Fatma Kilinç-Karzan (Math. Program., 2017)

A branch-and-bound algorithm for instrumental variable quantile regression. - Guanglin Xu; Samuel Burer (Math. Program. Comput., 2017)

Robust sensitivity analysis of the optimal value of linear programming. - Guanglin Xu; Samuel Burer (Optim. Methods Softw., 2017)

A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming. - Guanglin Xu; Samuel Burer (Comput. Manag. Sci., 2018)

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. - Guanglin Xu; Samuel Burer (Comput. Optim. Appl., 2018)

Quadratic programs with hollows. - Boshi Yang; Kurt M. Anstreicher; Samuel Burer (Math. Program., 2018)

Three methods for robust grading. - Samuel Burer; Veronica Piccialli (Eur. J. Oper. Res., 2019)

Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. - Samuel Burer; Yinyu Ye 001 (Math. Program., 2020)

Convex hull representations for bounded products of variables. - Kurt M. Anstreicher; Samuel Burer; Kyungchan Park (J. Glob. Optim., 2021)

Quadratic optimization with switching variables: the convex hull for n=2. - Kurt M. Anstreicher; Samuel Burer (Math. Program., 2021)

Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. - Samuel Burer; Yinyu Ye 001 (Math. Program., 2021)

Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. - Anders Eltved; Samuel Burer (Math. Program., 2023)

A Strengthened SDP Relaxation for Quadratic Optimization Over the Stiefel Manifold. - Samuel Burer; Kyungchan Park (J. Optim. Theory Appl., 2024)

A Semidefinite Relaxation for Sums of Heterogeneous Quadratic Forms on the Stiefel Manifold. - Kyle Gilman; Samuel Burer; Laura Balzano (SIAM J. Matrix Anal. Appl., 2025)

A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints. - Samuel Burer (Math. Program., 2025)