Samuel Burer

According to our database1, Samuel Burer authored at least 43 papers between 2002 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 





Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs.
Math. Program., 2020

Three methods for robust grading.
Eur. J. Oper. Res., 2019

Quadratic programs with hollows.
Math. Program., 2018

A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides.
Comp. Opt. and Appl., 2018

A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming.
Comput. Manag. Sci., 2018

Robust sensitivity analysis of the optimal value of linear programming.
Optimization Methods and Software, 2017

A branch-and-bound algorithm for instrumental variable quantile regression.
Math. Program. Comput., 2017

How to convexify the intersection of a second order cone and a nonconvex quadratic.
Math. Program., 2017

A Two-Variable Approach to the Two-Trust-Region Subproblem.
SIAM J. Optim., 2016

The trust region subproblem with non-intersecting linear constraints.
Math. Program., 2015

A gentle, geometric introduction to copositive optimization.
Math. Program., 2015

A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs.
SIAM J. Optim., 2014

Unbounded convex sets for non-convex mixed-integer quadratic programming.
Math. Program., 2014

Faster, but weaker, relaxations for quadratically constrained quadratic programs.
Comp. Opt. and Appl., 2014

Second-Order-Cone Constraints for Extended Trust-Region Subproblems.
SIAM J. Optim., 2013

Separation and relaxation for cones of quadratic forms.
Math. Program., 2013

Representing quadratically constrained quadratic programs as generalized copositive programs.
Oper. Res. Lett., 2012

Globally solving nonconvex quadratic programming problems via completely positive programming.
Math. Program. Comput., 2012

Relaxing the optimality conditions of box QP.
Comp. Opt. and Appl., 2011

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

Computable representations for convex hulls of low-dimensional quadratic forms.
Math. Program., 2010

On Nonconvex Quadratic Programming with Box Constraints.
SIAM J. Optim., 2009

A p-cone sequential relaxation procedure for 0-1 integer programs.
Optimization Methods and Software, 2009

On the copositive representation of binary and continuous nonconvex quadratic programs.
Math. Program., 2009

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound.
Comp. Opt. and Appl., 2009

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations.
Math. Program., 2008

Coordinating the supply chain in the agricultural seed industry.
Eur. J. Oper. Res., 2008

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization.
SIAM J. Optim., 2007

Solving maximum-entropy sampling problems using factored masks.
Math. Program., 2007

Solving Lift-and-Project Relaxations of Binary Integer Programs.
SIAM J. Optim., 2006

Computational enhancements in low-rank semidefinite programming.
Optimization Methods and Software, 2006

Ensemble Pruning Via Semi-definite Programming.
J. Mach. Learn. Res., 2006

Local Minima and Convergence in Low-Rank Semidefinite Programming.
Math. Program., 2005

D.C. Versus Copositive Bounds for Standard QP.
J. Global Optimization, 2005

Sharing Classifiers among Ensembles from Related Problem Domains.
Proceedings of the 5th IEEE International Conference on Data Mining (ICDM 2005), 2005

Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices.
SIAM J. Optim., 2003

A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming.
Optimization Methods and Software, 2003

A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs.
Math. Program., 2003

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization.
Math. Program., 2003

Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs.
SIAM J. Optim., 2002

Maximum stable set formulations and heuristics based on continuous optimization.
Math. Program., 2002

Solving a class of semidefinite programs via nonlinear programming.
Math. Program., 2002

Interior-Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation.
Comp. Opt. and Appl., 2002