Keywords

	Kurt M. Anstreicher Senior Associate Dean Leonard A. Hadley Chair in Leadership
	Management Sciences C120  John Pappajohn Bus Bldg The University of Iowa, Iowa City, IA 52242-1994	Ph: 319-335-0865 Fax: 319-335-0860 E-mail: kurt-anstreicher@uiowa.edu CV

Academic History

• PhD in Operations Research, Stanford University, 1983
• BA in Mathematics, Dartmouth College, 1978

Expertise

• Interior-Point Algorithms
• Linear and Nonlinear Programming
• Nonlinear Integer Programming

Awards

• Elected Fellow, INFORMS, 2011
• Fellow, CIC Academic Leadership Program (ALP), 2011
• G.R.E.A.T. Teaching Award, Executive MBA Program, 2004
• G.R.E.A.T. Teaching Award, Executive MBA Program, 2003
• G.R.E.A.T. Teaching Award, Executive MBA Program, 2002
• SIAM Interest Group on Optimization (SIAG/OPT) Prize for best paper in optimization (with N. Brixius, J.-P. Goux and J. Linderoth), 2002

Selected Publications

• An Approach to the Dodecahedral Conjecture based on Bounds for Spherical Codes, Kurt M. Anstreicher, Fields Institute Communications - Publication Details Forthcoming
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems, Samuel A. Burer, Kurt M. Anstreicher, SIAM Journal on Optimization - Publication Details Forthcoming
• Geometric Conditions for Euclidean Steiner Trees in R^d, Jon W. Van Laarhoven, Kurt M. Anstreicher, Computational Geometry: Theory and Applications, vol 46, 2013, 520-531
• Separating Doubly Nonnegative and Completely Positive Matrices, Hongbo Dong, Kurt M. Anstreicher, Mathematical Programming, vol 137, 2013, 131-153
• Interior-point Algorithms for a Generalization of Linear Programming and Weighted Centring, Kurt M. Anstreicher, Optimization Methods and Software, vol 27, 2012, 605-612
• On Convex Relaxations for Quadratically Constrained Quadratic Programming, Kurt M. Anstreicher, Mathematical Programming Series B, vol 136, 2012, 233-251
• A note on "5x5 Completely positive matrices", Hongbo Dong, Kurt M. Anstreicher, Linear Algebra and its Applications, vol 433, 2010, 1001-1004
• Computable Representations for Convex Hulls of Low-Dimensional Quadratic Forms, Kurt M. Anstreicher, Samuel A. Burer, Mathematical Programming Series B, vol 124, 2010, 33-43
• The Difference Between 5x5 Doubly Nonnegative and Completely Positive Matrices, Samuel A. Burer, Kurt M. Anstreicher, Mirjam Duer, Linear Algebra and Its Applications, vol 431, 2009, 1539-1552
• Two 'well-known' properties of subgradient optimization, Kurt M. Anstreicher, L. A. Wolsey, Mathematical Programming, Series B, vol 120, 2009, 213-220
• Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming, Kurt M. Anstreicher, Journal of Global Optimization, vol 43, 2009, 471-484
• An improved algorithm for computing Steiner minimal trees in Euclidean d-space, M. Fampa, Kurt M. Anstreicher, Discrete Optimization, vol 5, 2008, 530-540
• D.C. Versus Copositive Bounds for Standard QP, Kurt M. Anstreicher, Samuel A. Burer, Journal Of Global Optimization, vol 33, 2005, 299-312
• The Volumetric Barrier for Convex Quadratic Constraints, Kurt M. Anstreicher, Mathematical Programming, vol 100, 2004, 613-622
• The Thirteen Spheres: A New Proof, Kurt M. Anstreicher, Discrete and Computational Geometry, vol 31, 2004, 613-625
• Improved Complexity for Maximum-Volume Inscribed Ellipsoids, Kurt M. Anstreicher, SIAM Journal on Optimization, vol 13, 2003, 309-320
• Recent Advances in the Solution of Quadratic Assignment Problems, Kurt M. Anstreicher, Mathematical Programming Series B, vol 97, 2003, 27-42
• Improved Linear Programming Bounds for Antipodal Spherical Codes, Kurt M. Anstreicher, Discrete and Computational Geometry, vol 28, 2002, 107-114
• Solving Large Quadratic Assignment Problems on Computational Grids, Kurt M. Anstreicher, N. Brixius, J.-P. Goux, J. Linderoth, Mathematical Programming Series B, vol 91, 2002, 563-588
• A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite, Kurt M. Anstreicher, M. H. Wright, SIAM Journal on Optimization, vol 11, 2001, 243-253
• Eigenvalue Bounds Versus Semidefinite Relaxations for the Quadratic Assignment Problem, Kurt M. Anstreicher, SIAM Journal on Optimization, vol 11, 2001, 254-265
• Maximum-Entropy Remote Sampling, Kurt M. Anstreicher, M. Fampa, J. Lee, J. Williams, Discrete Applied Mathematics, vol 108, 2001, 259-274
• Solving Quadratic Assignment Problems Using Convex Quadratic Programming Relaxations, N. W. Brixius, Kurt M. Anstreicher, Optimization Methods and Software, vol 16, 2001, 49-68
• A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming, Kurt M. Anstreicher, N. W. Brixius, Mathematical Programming, vol 89, 2001, 341-357
• On Lagrangian Relaxation of Quadratic Matrix Constraints, Kurt M. Anstreicher, H. Wolkowicz, SIAM Journal on Matrix Analysis and Applications, vol 22, 2000, 41-55
• The Volumetric Barrier for Semidefinite Programming, Kurt M. Anstreicher, Mathematics of Operations Research, vol 25, 2000, 365-380

Conference Proceedings

• A Masked Spectral Bound for Maximum-Entropy Sampling, Kurt M. Anstreicher, Jon Lee, mODa 7 - Advances in Model-Oriented Design and Analysis, Physica-Verlag, 2004, 1-12

Other Work

• The Steinberg Wiring Problem, Nathan W. Brixius, Kurt M. Anstreicher, in The Sharpest Cut, M. Groetschel, ed., SIAM, 2004, 293-307
• Potential Reduction Algorithms, Kurt M. Anstreicher, in Interior Point Methods of Mathematical Programming, T. Terlaky, ed., Kluwer, 1996, 125-158

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

Prior Positions

• Research Fellow, Center for Operations Research and Econometrics (CORE), Louvain-la-Neuve, Belgium, September 1996 - June 1997
• Assistant/Associate Professor, Yale University, August 1982 - July 1991
• Research Fellow, Center for Operations Research and Econometrics (CORE), Louvain-la-Neuve, Belgium, September 1989 - June 1990

Professional Affiliations

• Editor, Mathematical Programming, Series A, August 2007 - August 2012
• Co-editor, Mathematical Programming, Series B Volume 111 Nos. 1-2 , January 2008

Presentations

• Second-Order-Cone Constraints for Extended Trust-Region Subproblems, Dept. of Industrial and Operations Engineering, University of Michigan, December 2012
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems, 21'st International Symposium on Mathematical Programming, Mathematical Optimization Society, Berlin, Germany, August 2012
• Optimization with Copositive and Completely Positive Matrices, MOPTA Conference, Lehigh University, July 2012
• Second-Order-Cone Constraints for Extended Trust-Region Subproblems, WID-DOW Seminar, Dept. of Industrial Engineering, University of Wisconsin, Madison, May 2012
• Nonconvex Quadratic Optimization over Simple Ground Sets, 37th Conference on Mathematics of Operations Research, Lunteren, Netherlands, January 2012
• Optimization with Copositive and Completely Positive Matrices, 37th Conference on Mathematics of Operations Research, Lunteren, Netherlands, January 2012
• Optimization with Copositive and Completely Positive Matrices, Dept. of Econometrics and Operations Research, Tilburg University, Tilburg, Netherlands, January 2012
• An Approach to the Dodecahedral Theorem based on Strengthened Bounds for Spherical Codes, Workshop on Optimization, Fields Institute, Toronto, Canada, September 2011
• Optimization with Copositive and Completely Positive Matrices, ISE Department, University of Illinois, Urbana-Champaign, IL, February 2011
• Optimization with Copositive and Completely Positive Matrices, ICOTA8 Meeting, Fudan University, Shanghai, China, December 2010
• Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming, INFORMS National Meeting, Institute for Operations Research and the Management Sciences, Austin, TX, November 2010
• Separating Doubly Nonnegative and Completely Positive Matrices, INFORMS National Meeting, Institute for Operations Research and the Management Sciences, Austin, TX, November 2010
• Comparing Convex Relaxations for Quadratically Constrained Quadratic Programming, European Workshop on MINLP, Marseilles, France, April 2010
• Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope, Dept. of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, December 2009
• Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope, Dept. of Systems Engineering, Chinese University of Hong Kong, Hong Kong, October 2009
• Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope, 20th International Symposium on Mathematical Programming, Mathematical Programming Society, Chicago, IL, August 2009
• Nonconvex Quadratic Programming: Return of the Boolean Quadric Polytope, Integer Programming at CORE, Center for Operations Research and Econometrics (CORE), Louvain-la-Neuve, Belgium, May 2009
• Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming, Dept. of Decision Sciences, Duke University, Durham, NC, December 2008
• Computable Representations for Convex Hulls of Low-Dimensional Quadratic Forms, Dept. of Industrial Engineering, University of Wisconsin, Madison, WI, November 2008
• The Difference between 5x5 Double Nonnegative and Completely Positive Matrices, IMA Hot Topics Workshop on Mixed-Integer Nonlinear Programming, Institute for Mathematics and its Applications, Minneapolis, MN, November 2008
• Strengthened Quadratic Programming Bounds for QAP, INFORMS National Meeting, Institute for Operations Research and the Management Sciences, Washington, DC, October 2008
• The Difference between 5x5 Double Nonnegative and Completely Positive Matrices, SIAM Conference on Optimization, Society for Industrial and Applied Mathematics, Boston, MA, May 2008
• Computable Representations for Convex Hills of Low-Dimensional Quadratic Forms, Aussois Workshop on Discrete Optimization, Aussois, France, January 2008
• Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming, Workshop on Advances in Global Optimization, Myconos, Greece, June 2007
• Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming, GIGOLAG Workshop on Global Optimization - Integrating Convexity, Optimization, Logic Programming, and Computational Algebraic Geometry, University of Vienna, Vienna, Austria, December 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, VICCOC - Vienna International Continuous and Combinatorial Optimization Colloquium, University of Vienna, Vienna, Austria, December 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, 19th International Symposium on Mathematical Programmming, Mathematical Programming Society, Rio de Janeiro, Brazil, August 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, Dept. of Industrial Engineering, Lehigh University, Lehigh, Pennsylvania, April 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, Dept. of Supply Chain and Information Systems, Pennsylvania State University, State College, PA, April 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, IBM Watson Research Center, Yorktown Heights, NY, April 2006
• An Improved Algorithm for Computing Steiner Minimal Trees in R^d, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, November 2005
• Musin's Proof of the Kissing Number in Dimension Four, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, January 2005
• Semidefinite Programming versus the Reformulation-Linearization Technique for Nonconvex Quadratically Constrained Quadratic Programming, Workshop on Continuous Optimization and Integer Programming, Chemnitz, Germany, November 2004
• The Problem of the Thirteen Spheres, 5th Brazilian Workshop on Continuous Optimization, Florianopolis, Brazil, March 2004
• Recent Advances in the Solution of Quadratic Assignment Problems, 18th International Symposium on Mathematical Programming, Mathematical Programming Society, Copenhagen, Denmark, August 2003
• The Problem of the Thirteen Spheres, Operations Research Center, MIT, Cambridge, MA, October 2002
• Improved Complexity for Maximum Volume Inscribed Ellipsoids, SIAM Optimization Meeting, Society for Industrial and Applied Mathematics, Toronto, Canada, May 2002
• Solving Large Quadratic Assignment Problems on Computational Grids, SIAM Optimization Meeting, Society for Industrial and Applied Mathematics, May 2002
• The Steinberg Wiring Problem, Mathematisches Forschungsinstitut Oberwolfach, Oberwolfach, Germany, January 2002

Committees and Professional Service

• Academic Calendar Revision Committee, 2012-2013
• Learning Spaces Advisory Committee, 2012-2013
• Executive Committee Chair, Mathematical Optimization Society, 2010-2013
• INFORMS Khachiyan Prize Committee, 2012
• Executive Committee, Program in Applied Mathematical and Computational Sciences, 2010-2012
• Dual Career Network Advisory Committee, 2008-2012
• MOS/SIAM Lagrange Prize Committee, 2012
• Tippie College Dean Search Committee, 2011-2012
• Nominating Committee, SIAM Interest Group on Optimization, 2010
• INFORMS Von Neumann Prize Committee, 2007-2010
• Provost's Task Force on Graduate and Professional Education, 2009
• Co-chair, SIAM 2008 Optimization Conference Organizing Committee, 2007-2008
• Chair, SIAM Interest Group on Optimization (SIAG/OPT), 2004-2008
• AMCS Advisory Committee, 2005-2007
• Dean's Advisory Council, 2005-2007
• Graduate College Spriestersbach Prize Committee, 2006
• Tippie College Dean Search Committee, 2005-2006
• Economics Department External Review Committee, 2003
• Graduate College Self-Study Committee, 2002-2003