Samuel Burer
According to our database^{1},
Samuel Burer
authored at least 43 papers
between 2002 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at orcid.org
On csauthors.net:
Bibliography
2020
Exact semidefinite formulations for a class of (random and nonrandom) nonconvex quadratic programs.
Math. Program., 2020
2019
Three methods for robust grading.
Eur. J. Oper. Res., 2019
2018
Quadratic programs with hollows.
Math. Program., 2018
A copositive approach for twostage adjustable robust optimization with uncertain righthand sides.
Comp. Opt. and Appl., 2018
A datadriven distributionally robust bound on the expected optimal value of uncertain mixed 01 linear programming.
Comput. Manag. Sci., 2018
2017
Robust sensitivity analysis of the optimal value of linear programming.
Optimization Methods and Software, 2017
A branchandbound 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
2016
A TwoVariable Approach to the TwoTrustRegion Subproblem.
SIAM J. Optim., 2016
2015
The trust region subproblem with nonintersecting linear constraints.
Math. Program., 2015
A gentle, geometric introduction to copositive optimization.
Math. Program., 2015
2014
A FirstOrder Smoothing Technique for a Class of LargeScale Linear Programs.
SIAM J. Optim., 2014
Unbounded convex sets for nonconvex mixedinteger quadratic programming.
Math. Program., 2014
Faster, but weaker, relaxations for quadratically constrained quadratic programs.
Comp. Opt. and Appl., 2014
2013
SecondOrderCone Constraints for Extended TrustRegion Subproblems.
SIAM J. Optim., 2013
Separation and relaxation for cones of quadratic forms.
Math. Program., 2013
2012
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
2011
Relaxing the optimality conditions of box QP.
Comp. Opt. and Appl., 2011
2010
Optimizing a polyhedralsemidefinite relaxation of completely positive programs.
Math. Program. Comput., 2010
Computable representations for convex hulls of lowdimensional quadratic forms.
Math. Program., 2010
2009
On Nonconvex Quadratic Programming with Box Constraints.
SIAM J. Optim., 2009
A pcone sequential relaxation procedure for 01 integer programs.
Optimization Methods and Software, 2009
On the copositive representation of binary and continuous nonconvex quadratic programs.
Math. Program., 2009
Globally solving boxconstrained nonconvex quadratic programs with semidefinitebased finite branchandbound.
Comp. Opt. and Appl., 2009
2008
A finite branchandbound 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
2007
On Handling Free Variables in InteriorPoint Methods for Conic Linear Optimization.
SIAM J. Optim., 2007
Solving maximumentropy sampling problems using factored masks.
Math. Program., 2007
2006
Solving LiftandProject Relaxations of Binary Integer Programs.
SIAM J. Optim., 2006
Computational enhancements in lowrank semidefinite programming.
Optimization Methods and Software, 2006
Ensemble Pruning Via Semidefinite Programming.
J. Mach. Learn. Res., 2006
2005
Local Minima and Convergence in LowRank 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
2003
Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices.
SIAM J. Optim., 2003
A General Framework for Establishing Polynomial Convergence of LongStep Methods for Semidefinite Programming.
Optimization Methods and Software, 2003
A computational study of a gradientbased logbarrier algorithm for a class of largescale SDPs.
Math. Program., 2003
A nonlinear programming algorithm for solving semidefinite programs via lowrank factorization.
Math. Program., 2003
2002
RankTwo Relaxation Heuristics for MAXCUT 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
InteriorPoint Algorithms for Semidefinite Programming Based on a Nonlinear Formulation.
Comp. Opt. and Appl., 2002