NLP and MINLP test problems

The following test libraries are routinely used in the context of developing BARON.  Some of these problems originate from applications, while others have been designed to challenge solvers.  

Sources:
  1. Performance World.
  2. MPECLib.
  3. Bao, X., N. V. Sahinidis, and M. Tawarmalani, Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs, Optimization Methods and Software, 24, 485-504, 2009.
  4. Bao, X., N. V. Sahinidis and M. Tawarmalani, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Mathematical Programming, 129:129-157, 2011.
  5. Bao, X., A. Khajavirad, N. V. Sahinidis, and M. Tawarmalani, Global optimization of nonconvex problems with multilinear intermediates, Mathematical Programming Computation, 7, 1-37, 2015.
  6. Vandenbussche, D. and G. Nemhauser, A branch-and-cut algorithm for nonconvex quadratic programs with box constraints, Mathematical Programming, 102, 559-575, 2005.
  7. minlp.org.
  8. OR-Lib.
  9. CMU-IBM open-source MINLP project.
  10. Puranik, Y. and N. V. Sahinidis, Deletion presolve for accelerating infeasibility diagnosis in optimization models, forthcoming, 2017.
  11. Sherali, H. D., E. Dalkiran and J. Desai, Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts, Computational Optimization and Applications, 52, 483-506, 2012.
  12. Sherali, H. D., E. Dalkiran and L. Liberti, Reduced RLT representations for nonconvex polynomial programming problems, Journal of Global Optimization, 52, 447-469, 2012.
  13. Puranik, Y. and N. V. Sahinidis, Bounds tightening on optimality conditions for nonconvex box-constrained optimization, Journal of Global Optimization, accepted, to appear in 2017.