Website/CV

• dollar.biz.uiowa.edu/~sburer

Academic History

• PhD in Algorithms, Combinatorics, and Optimization, Georgia Institute of Technology, 2001
• BS in Mathematics, University of Georgia, 1997

Expertise

• Operations research
• Mathematical programming

Awards

• Honorable Mention, Young Researcher Competition, International Conference on Continuous Optimization, 2004
• Martha and Dennis Hesse Research Fellow, 2004
• "New Hot Paper" recognition by ISI Essential Science Indicators, 2003
• INFORMS Optimization Prize for Young Researchers, 2002
• Delta Sigma Pi Outstanding Faculty Award, 2002

Grants

• National Science Foundation CAREER Grant, 2006-2011, $400,000
• University of Iowa New Technology in the Learning Environment (nTITLE) Grant, $1,500, 2004-2005
• National Science Foundation Grant in Numeric, Symbolic, and Geometric Computation, 2002-2006, $255,000 (half of $510,000 in collaboration with R.D.C. Monteiro)
• University of Iowa Old Gold Summer Fellowships, 2002-2003, $12,000

Selected Publications

• On Handling Free Variables in Interior-Point Methods for Conic Linear Optimization (with M. Anjos), SIAM Journal on Optimization, Vol. 18, 2007, 1310-1325.
• Coordinating the Supply Chain in the Agricultural Seed Industry (with P. Jones and T. Lowe), European Journal of Operational Research, Vol. 185, 2008, 354-377.
• Solving Maximum-Entropy Sampling Problems Using Factored Masks (with J. Lee), Mathematical Programming, Vol. 109, 2007, 263-281.
• Ensemble Pruning via Semi-definite Programming (with Y. Zhang and W. Nick Street), Journal of Machine Learning Research, Vol. 7, 2006, 1315-1338.
• Solving Lift-and-Project Relaxations of Binary Integer Programs (with D. Vandenbussche), SIAM Journal on Optimization, Vol. 16, 2006, 726-750.
• Sharing Classifiers among Ensembles from Related Problem Domains (with Y. Zhang and W. Nick Street), Proceedings of the Fifth IEEE International Conference on Data Mining (ICDM'05), 2005, 522-529.
• Computational Enhancements in Low-Rank Semidefinite Programming (with C. Choi), Optimization Methods and Software, Vol. 21, 2006, 493-512.
• D.C. Versus Copositive Bounds for Standard QP (with K. Anstreicher), Journal of Global Optimization, Vol. 33, 2005, 229-312.
• Local Minima and Convergence in Low-Rank Semidefinite Programming (with R.D.C. Monteiro), Mathematical Programming, Vol. 103, 2005, 427-444.
• Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices, SIAM Journal on Optimization, Vol. 14, 2003, 139-172.
• A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming (with R.D.C. Monteiro), Optimization Methods and Software, Vol. 18, 2003, 1-38.
• A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs (with R.D.C. Monteiro, Y. Zhang), Mathematical Programming (Series B), Vol. 95, 2003, 359-379.
• A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-Rank Factorization (with R.D.C. Monteiro), Mathematical Programming (Series B), Vol. 95, 2003, 329-357.
• Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization (with R.D.C. Monteiro, Y. Zhang), Mathematical Programming, Vol. 94, 2002, 137-166.
• Solving a Class of Semidefinite Programs via Nonlinear Programming (with R.D.C. Monteiro, Y. Zhang), Mathematical Programming, Vol. 93, 2002, 97-122.
• Interior Point Algorithms for Semidefinite Programming Based on a Nonlinear Formulation (with R.D.C. Monteiro, Y. Zhang), Computational Optimization and Applications, Vol. 22, 2002, 49-79.
• Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs (with R.D.C. Monteiro, Y. Zhang), SIAM Journal on Optimization, Vol. 12, 2001, 503-521.
• A Projected Gradient Algorithm for Solving the Maxcut SDP Relaxation (with R.D.C. Monteiro), Optimization Methods and Software, Vol. 15, 2001, 175-200.

Work in Progress

• A p-Cone Sequential Relaxation Procedure for 0-1 Integer Programs (with J. Chen).
• Relaxing the Optimality Conditions of Box QP (with J. Chen).
• Computable representations for convex hulls of low-dimensional quadratic forms (with K. Anstreicher).
• Globally Solving Box-Constrained Nonconvex Quadratic Programs with Semidefinite-Based Finite Branch-and-Bound (with D. Vandenbussche).
• On the Copositive Representation of Binary and Continuous Nonconvex Quadratic Programs.
• A Finite Branch-and-Bound Algorithm for Nonconvex Quadratic Programming via Semidefinite Relaxations (with D. Vandenbussche).
• Convex Optimization of Centralized Inventory Operations (with M. Dror).

Professional Affiliations

• Institute for Operations Research and the Management Sciences
• Mathematical Programming Society
• Society of Industrial and Applied Mathematics

Review and Editorial Work

• Referee, SIAM Journal on Optimization
• Referee, Mathematical Programming
• Referee, Mathematics of Operations Research
• Referee, Annals of Operations Research

Media Citings

• Iowa City Press-Citizen, 04/07/2006
• Business at Iowa, 00/00/2004
• Cedar Rapids Gazette, 08/03/2002
• The Daily Iowan, 08/31/2001

Spring 2008 Courses

• 06K:217    Data and Decisions II
• 06N:216    Data & Decisions

Fall 2007 Courses

• 06K:286    Optimization Methods
• 06N:216    Data & Decisions