Samuel Burer
Professor, and Director, Business Analytics Graduate Program
George Daly Professor of Management Sciences
Contact
319-335-0931
Office
S346 Pappajohn Business Building (PBB)
Academic history 
PhD in Algorithms, Combinatorics, and Optimization, Georgia Institute of Technology, 2001
BS in Mathematics, University of Georgia, 1997
Expertise 
Mathematical optimization
Operations research
Awards 
G.R.E.A.T. Faculty Award (First Year), Des Moines Executive MBA Class of 2012, April 2012
Dean's Teaching Award in Management Sciences, Tippie College of Business, 2011
Best Paper Award, Computational Optimization and Applications, 2009
Martha and Dennis Hesse Research Fellow, 2004
Honorable Mention, Young Researcher Competition, International Conference on Continuous Optimization, Mathematical Programming Society, August 2004
New Hot Paper recognition by ISI Essential Science Indicators, 2003
Delta Sigma Pi Outstanding Faculty Award, 2002
INFORMS Optimization Prize for Young Researchers, 2002
Selected publications 

A Two-Variable Analysis of the Two-Trust-Region Subproblem. Samuel A. Burer, Boshi Yang, SIAM Journal on Optimization, 2016, vol 26, 661-680

A Gentle, Geometric Introduction to Copositive Optimization. Samuel A. Burer, Mathematical Programming Series B (forthcoming), Mathematical Programming Series B, 2015, vol 151, 89-116

The Trust Region Subproblem with Non-Intersecting Linear Constraints. Samuel A. Burer, Boshi Yang, Mathematical Programming (Series A) (forthcoming), Mathematical Programming Series A, 2015, vol 149, 253-264

Modifying Soyster's Model for the Symmetric Traveling Salesman Problem with Interval Travel Times. Nayoung Cho, Samuel A. Burer, Ann Melessa Campbell, Far East Journal of Applied Mathematics, 2014, vol 86, 117-144

Faster, but Weaker, Relaxations for Quadratically Constrained Quadratic Programs. Samuel A. Burer, Computational Optimization and Applications (forthcoming), Computational Optimization and Applications, 2014, vol 59, 27-45

A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs. Samuel A. Burer, Jieqiu Chen, SIAM Journal on Optimization (forthcoming), SIAM Journal on Optimization, 2014, vol 24, 598-620

Unbounded convex sets for non-convex mixed-integer quadratic programming. Samuel A. Burer, Adam N. Letchford, Mathematical Programming Series A (forthcoming), Mathematical Programming Series A, 2014, vol 143, 231-256

Second-Order-Cone Constraints for Extended Trust-Region Subproblems. Samuel A. Burer, Kurt M. Anstreicher, SIAM Journal on Optimization, 2013, vol 23, 432-451

Separation and relaxation for cones of quadratic forms. Samuel A. Burer, Hongbo Dong, Mathematical Programming Series A, 2013, vol 137, 343-370

Globally solving nonconvex quadratic programming problems via completely positive programming. Samuel A. Burer, Jieqiue Chen, Mathematical Programming Computation, 2012, vol 4, 33-52

Non-convex mixed-integer nonlinear programming: A survey. Samuel A. Burer, Adam Letchford, Surveys in Operations Research and Management Science, 2012, vol 17, 97-106

Representing quadratically constrained quadratic programs as generalized copositive programs. Samuel A. Burer, Hongbo Dong, Operations Research Letters, 2012, vol 40, 203-206

Robust rankings for college football. Samuel A. Burer, Journal of Quantitative Analysis in Sports, 2012, vol 8

Relaxing the Optimality Conditions of Box QP. Samuel A. Burer, Jieqiu Chen, Computational Optimization and Applications, 2011, vol 48, 653-673

A Semidefinite Approach to the Hypergraph Minimum Bisection Problem. Changhui Choi, Samuel A. Burer, Optimization, 2011, vol 60, 413-427

Computable Representations for Convex Hulls of Low-Dimensional Quadratic Forms. Kurt M. Anstreicher, Samuel A. Burer, Mathematical Programming Series B, 2010, vol 124, 33-43

Optimizing a Polyhedral-Semidefinite Relaxation of Completely Positive Programs. Samuel A. Burer, Mathematical Programming Computation, 2010, vol 2, 1-19

A p-Cone Sequential Relaxation Procedure for 0-1 Integer Programs. Samuel A. Burer, Jieqiu Chen, Optimization Methods and Software, 2009, vol 24, 523-548

On Non-Convex Quadratic Programming with Box Constraints. Samuel A. Burer, Adam N. Letchford, SIAM Journal on Optimization, 2009, vol 20, 1073-1089

On the Copositive Representation of Binary and Continuous Nonconvex Quadratic Programs. Samuel A. Burer, Mathematical Programming Series A, 2009, vol 120, 479-495

The Difference Between 5x5 Doubly Nonnegative and Completely Positive Matrices. Samuel A. Burer, Kurt M. Anstreicher, Mirjam Duer, Linear Algebra and Its Applications, 2009, vol 431, 1539-1552

A Finite Branch-and-Bound Algorithm for Nonconvex Quadratic Programming via Semidefinite Relaxations. Samuel A. Burer, Dieter Vandenbussche, Mathematical Programming Series A, 2008, vol 113, 259-282

Coordinating the Supply Chain in the Agricultural Seed Industry. Samuel A. Burer, Philip C. Jones, Timothy J. Lowe, European Journal of Operational Research, 2008, vol 185, 354-377

On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization. Samuel A. Burer, Miguel Anjos, SIAM Journal on Optimization, 2007, vol 18, 1310-1325

Solving Maximum-Entropy Sampling Problems Using Factored Masks. Samuel A. Burer, Jon Lee, Mathematical Programming, 2007, vol 109, 263-281

Globally Solving Box-Constrained Nonconvex Quadratic Programs with Semidefinite-Based Finite Branch-and-Bound. Samuel A. Burer, Dieter Vandenbussche, Computational Optimization and Applications, 2007, vol 43, 181-195

Computational Enhancements in Low-Rank Semidefinite Programming. Samuel A. Burer, Changhui Choi, Optimization Methods and Software, 2006, vol 21, 493-512

Ensemble Pruning via Semi-definite Programming. Samuel A. Burer, Yi Zhang, Nick Street, Journal of Machine Learning Research, 2006, vol 7, 1315-1338

Solving Lift-and-Project Relaxations of Binary Integer Programs. Samuel A. Burer, Dieter Vandenbussche, SIAM Journal on Optimization, 2006, vol 16, 726-750

D.C. Versus Copositive Bounds for Standard QP. Kurt M. Anstreicher, Samuel A. Burer, Journal Of Global Optimization, 2005, vol 33, 299-312

Local Minima and Convergence in Low-Rank Semidefinite Programming. Samuel A. Burer, Renato D. C. Monteiro, Mathematical Programming Series A, 2005, vol 103, 427-444

A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs. Samuel A. Burer, Renato D. C. Monteiro, Yin Zhang, Mathematical Programming Series B, 2003, vol 95, 359-379

A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming. Samuel A. Burer, Renato D. C. Monteiro, Optimization Methods and Software, 2003, vol 18, 1-38

A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-Rank Factorization. Samuel A. Burer, Renato D. C. Monteiro, Mathematical Programming Series B, 2003, vol 95, 329-357

Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices. Samuel A. Burer, SIAM Journal on Optimization, 2003, vol 14, 139-172

Interior Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation. Samuel A. Burer, Renato D. C. Monteiro, Yin Zhang, Computational Optimization and Applications, 2002, vol 22, 49-79

Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization. Samuel A. Burer, Renato D. C. Monteiro, Yin Zhang, Mathematical Programming Series A, 2002, vol 94, 137-166

Solving a Class of Semidefinite Programs via Nonlinear Programming. Samuel A. Burer, Renato D. C. Monteiro, Yin Zhang, Mathematical Programming Series A, 2002, vol 93, 97-122

A Projected Gradient Algorithm for Solving the Maxcut SDP Relaxation. Samuel A. Burer, Renato D. C. Monteiro, Optimization Methods and Software, 2001, vol 15, 175-200

Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs. Samuel A. Burer, Renato D. C. Monteiro, Yin Zhang, SIAM Journal on Optimization, 2001, vol 12, 503-521

Working papers 

Nearly Efficient Tuitions and Subsidies in American Public Higher Education. Samuel A. Burer, Gary C. Fethke, accepted at Economics of Education Review

How to Convexify the Intersection of a Second Order Cone and a Nonconvex Quadratic. Samuel A. Burer, accepted at Mathematical Programming Series A

Quadratic Programs with Hollows. Boshi Yang, Kurt M. Anstreicher, Samuel A. Burer

Sponsored research 

CAREER: Computation, Theory, and Applications for Nonconvex Quadratic and Conic Optimization. Samuel A Burer, National Science Foundation

Collaborative Research: Theory and Applications for Nonconvex Quadratic and Conic Optimization. Samuel A Burer, National Science Foundation

Conference proceedings 

Sharing Classifiers among Ensembles from Related Problem Domains. Samuel A. Burer, Yi Zhang, Nick Street, Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM'05), 2005, 522-529

Other work 

The MILP Road to MIQCP. Samuel A. Burer, Anureet Saxena, IMA Volumes in Mathematics and Its Applications, 2011, vol 154, 373-406

Work in progress 

An Algorithm for Computing the CP-Factorization of a Completely Positive Matrix. Kurt M. Anstreicher, Samuel A. Burer, Peter J.C. Dickinson

Current and prior positions 
Professor, Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa, August 2012 - Present
Associate Professor, Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa, August 2007 - July 2012
Assistant Professor, Department of Management Sciences, Henry B. Tippie College of Business, The University of Iowa, August 2001 - July 2007
Visiting Assistant Professor, Operations Research Group, Carnegie Mellon University, January 2007 - May 2007
Research Intern, Wolfram Research, June 1997 - October 1997
Review and editorial work 

Referee, Annals of Operations Research

Referee, ANZIAM Journal

Referee, Automatica

Referee, Discrete Applied Mathematics

Referee, Discrete Optimization

Referee, European Journal of Operational Research

Referee, INFORMS Journal on Computing

Referee, Journal of Global Optimization

Referee, Journal of Graphical and Computational Statistics

Referee, Journal of Heuristics

Referee, Journal of Machine Learning Research

Referee, Journal of Mathematical Analysis and Applications

Referee, Mathematical Programming

Referee, Mathematics of Operations Research

Referee, Optimization and Engineering

Referee, Optimization Letters

Referee, Optimization Methods and Software

Referee, SIAM Journal on Optimization

Co-editor, Discrete Optimization (special issue), 2014 - Current

Associate Editor, Mathematics of Operations Research, 2011 - Current

Associate Editor, SIAM Journal on Optimization, 2011 - Current

Associate Editor, Mathematical Programming Computation, 2008 - 2013

Associate Editor, Asia-Pacific Journal of Operational Research, 2007 - 2010

Presentations 

Optimizing a Polyhedral-Semidefinite Relaxation of Completely Positive Programs. Universita di Firenze, Florence, Italy, May 2009

Committees and professional service 
INFORMS Computing Society, 2014 - 2017
Mathematical Optimization Society, 2012 - 2015