Tuning BARON using derivative-free optimization algorithms

Optimization solvers include many options that allow users to control algorithmic aspects that may have a considerable impact on solver performance. Tuning solver options is often necessary to reduce execution time and improve solution quality. Previous studies of solver tuning techniques have focused on mixed-integer linear programming and local nonlinear programming solvers. In this paper, we investigate the potential of tuning a global optimization solver for nonlinear and mixed-integer nonlinear programming problems. In particular, derivative-free optimization (DFO) algorithms are used to find optimal values for options of the global optimization solver BARON. A set of 126 problems from the GLOBALLib and MINLPLib collections are utilized in a computational study from which we conclude that tuning options can improve the default performance of BARON for individual problems and an entire library. Additionally, we present a systematic comparison of 27 DFO solvers in terms of their ability to improve the performance of the global solver. We find that several DFO implementations are much better than others in terms of finding optimal tuning parameters.

[1]  Shu-Kai S. Fan,et al.  A hybrid simplex search and particle swarm optimization for unconstrained optimization , 2007, Eur. J. Oper. Res..

[2]  M. Kokkolaras,et al.  Optimal Design of Hybrid Fuel Cell Vehicles , 2006 .

[3]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

[4]  L. N. Vicente,et al.  Using simplex gradients of nonsmooth functions in direct search methods , 2008 .

[5]  Nikolaos V. Sahinidis,et al.  Global optimization of general non-convex problems with intermediate bilinear substructures , 2014, Optim. Methods Softw..

[6]  Hans-Martin Gutmann,et al.  A Radial Basis Function Method for Global Optimization , 2001, J. Glob. Optim..

[7]  Nikolaos V. Sahinidis,et al.  Bounds tightening based on optimality conditions for nonconvex box-constrained optimization , 2017, J. Glob. Optim..

[8]  Virginia Torczon,et al.  On the Convergence of Pattern Search Algorithms , 1997, SIAM J. Optim..

[9]  Nikolaos V. Sahinidis,et al.  Global optimization of mixed-integer nonlinear programs: A theoretical and computational study , 2004, Math. Program..

[10]  Nikolaos V. Sahinidis,et al.  Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs , 2009, Optim. Methods Softw..

[11]  Kevin Leyton-Brown,et al.  Automated Configuration of Mixed Integer Programming Solvers , 2010, CPAIOR.

[12]  Kevin Leyton-Brown,et al.  Sequential Model-Based Optimization for General Algorithm Configuration , 2011, LION.

[13]  Katya Scheinberg,et al.  On the convergence of derivative-free methods for unconstrained optimization , 1997 .

[14]  C. D. Perttunen,et al.  Lipschitzian optimization without the Lipschitz constant , 1993 .

[15]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[16]  Nikolaos V. Sahinidis,et al.  Global Optimization and Constraint Satisfaction: The Branch-and-Reduce Approach , 2002, COCOS.

[17]  M. Powell.  A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation , 1994 .

[18]  Nikolaos V. Sahinidis,et al.  Planning of Chemical Process Networks via Global Concave Minimization , 1996 .

[19]  Thomas Stützle,et al.  Automatic Algorithm Configuration Based on Local Search , 2007, AAAI.

[20]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[21]  Nikolaos V. Sahinidis,et al.  Domain reduction techniques for global NLP and MINLP optimization , 2017, Constraints.

[22]  Oleg A. Prokopyev,et al.  How much do we “pay” for using default parameters? , 2011, Comput. Optim. Appl..

[23]  Nikolaos V. Sahinidis,et al.  A branch-and-reduce approach to global optimization , 1996, J. Glob. Optim..

[24]  Fred W. Glover,et al.  ' s personal copy Continuous Optimization Finding local optima of high-dimensional functions using direct search methods , 2008 .

[25]  Simon P. Wilson,et al.  Using DIRECT to Solve an Aircraft Routing Problem , 2002, Comput. Optim. Appl..

[26]  Nikolaos V. Sahinidis,et al.  BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..

[27]  J. Hiriart-Urruty,et al.  Comparison of public-domain software for black box global optimization , 2000 .

[28]  Luís N. Vicente,et al.  A particle swarm pattern search method for bound constrained global optimization , 2007, J. Glob. Optim..

[29]  Weifeng Chen,et al.  Random Sampling-Based Automatic Parameter Tuning for Nonlinear Programming Solvers , 2011 .

[30]  Arnold Neumaier,et al.  Global Optimization by Multilevel Coordinate Search , 1999, J. Glob. Optim..

[31]  Charles Audet,et al.  Mesh Adaptive Direct Search Algorithms for Constrained Optimization , 2006, SIAM J. Optim..

[32]  CHARLES AUDET,et al.  Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization , 2006, SIAM J. Optim..

[33]  N. Sahinidis,et al.  Product Disaggregation in Global Optimization and Relaxations of Rational Programs , 2002 .

[34]  Michael R. Bussieck,et al.  MINLPLib - A Collection of Test Models for Mixed-Integer Nonlinear Programming , 2003, INFORMS J. Comput..

[35]  Nikolaos V. Sahinidis,et al.  Derivative-free optimization: a review of algorithms and comparison of software implementations , 2013, J. Glob. Optim..

[36]  Nikolaos V. Sahinidis,et al.  A Finite Algorithm for Global Minimization of Separable Concave Programs , 1998, J. Glob. Optim..

[37]  Stefan M. Wild,et al.  Benchmarking Derivative-Free Optimization Algorithms , 2009, SIAM J. Optim..

[38]  M. Powell.  Recent research at Cambridge on radial basis functions , 1999 .

[39]  Nikolaos V. Sahinidis,et al.  Convex extensions and envelopes of lower semi-continuous functions , 2002, Math. Program..

[40]  Charles Audet,et al.  Comparison of derivative-free optimization methods for groundwater supply and hydraulic capture community problems , 2008 .

[41]  G. R. Hext,et al.  Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation , 1962 .