Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces

References

• R. Baker Kearfott, Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems, Computing 47(2) (1991), pp. 169–191. doi: 10.1007/BF02253433
   Web of Science ®Google Scholar
• R. Baker Kearfott, Rigorous Global Search: Continuous Problems, Number 13 in Nonconvex optimization and its applications, Kluwer Academic Publishers, Norwell, MA, and Dordrecht, The Netherlands, 1996.
   Google Scholar
• R. Baker Kearfott, On proving existence of feasible points in equality constrained optimization problems, Math. Program. 83(1) (1998), pp. 89–100.
   Web of Science ®Google Scholar
• R. Baker Kearfott and S. Hongthong, Validated linear relaxations and preprocessing: Some experiments, SIAM J. Optim. 16(2) (2005), pp. 418–433. doi: 10.1137/030602186
   Web of Science ®Google Scholar
• R. Baker Kearfott, Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization, Optim. Methods Softw. 21 (2006), pp. 715–731. doi: 10.1080/10556780500130525
   Web of Science ®Google Scholar
• R. Baker Kearfott, GlobSol user guide, Optim. Methods Softw. 24(4–5) (2009), pp. 687–708. doi: 10.1080/10556780802614051
   Web of Science ®Google Scholar
• R. Baker Kearfott, Interval computations, rigour and non-rigour in deterministic continuous global optimization, Optim. Methods Softw. 26(2) (2011), pp. 259–279. doi: 10.1080/10556781003636851
   Web of Science ®Google Scholar
• R. Baker Kearfott, Erratum: Validated linear relaxations and preprocessing: Some experiments, SIAM J. Optim. 21(1) (2011), pp. 415–416. doi: 10.1137/100816080
   Web of Science ®Google Scholar
• R. Baker Kearfott, Optimization by discretization experiments, 2012. Available at http://interval.louisiana.edu/preprints/optimization-by-discretization-experiments.
   Google Scholar
• R. Baker Kearfott, J. Castille, and G. Tyagi, A general framework for convexity analysis and an alternative to branch and bound in deterministic global optimization, J. Global Optim. (2012). DOI 10.1007/s10898-012-9905-4
   Web of Science ®Google Scholar
• T.G.W. Epperly and E.N. Pistikopoulos, A reduced space branch and bound algorithm for global optimization, J. Global Optim. 11(3) (1997), pp. 287–311. doi: 10.1023/A:1008212418949
   Web of Science ®Google Scholar
• C. Floudas, Deterministic Global Optimization: Theory, Methods, and Applications, Kluwer Academic Publishers, Dordrecht, he Netherlands, 2000.
   Google Scholar
• C. Floudas. Deterministic global optimization: Advances and challenges, Plenary Lecture, First World Congress on Global Optimization in Engineering and Sciences, WCGO-2009, June 2009.
   Google Scholar
• K. Fong, T. Jefferson, T. Suyehiro, and L. Walton, Guide to the SLATEC common mathematical library, Tech. Rep. netlib.org, 1990. Available at http://www.netlib.org/slatec/.
   Google Scholar
• J. Hall, Homepage of C-LP, 2002. Available at https://projects.coin-or.org/Clp.
   Google Scholar
• H. Mittelmann, Benchmarks for optimization software, 2012. Available at http://plato.asu.edu/bench.html
   Google Scholar
• A. Neumaier, COCONUT Web page, 2001–2003. Available at http://www.mat.univie.ac.at/~neum/glopt/coconut
   Google Scholar
• A. Neumaier and O. Shcherbina, Safe bounds in linear and mixed-integer programming, Math. Program. 99(2) (2004), pp. 283–296. doi: 10.1007/s10107-003-0433-3
   Web of Science ®Google Scholar
• J. Ninin, Optimisation Globale Basée sur l'Analyse d'Intervalles: Relaxations Affines et Techniques d'Accélération, Ph.D. diss., Université de Toulouse, Toulouse, France, 2010.
   Google Scholar
• J. Ninin and F. Messine, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, J. Global Optim. 50(4) (2011), pp. 629–644. doi: 10.1007/s10898-010-9531-y
   Web of Science ®Google Scholar
• J. Ninin, F. Messine, and P. Hansen, A reliable affine relaxation method for global optimization, Rapport de recherche, RT-APO-10-05, IRIT, March 2010. Available at ftp://ftp.irit.fr/IRIT/APO/RT-APO-10-05.pdf.
   Google Scholar
• O. Shcherbina, A. Neumaier, D. Sam-Haroud, X.-H. Vu, and T.-V. Nguyen, Benchmarking global optimization and constraint satisfaction codes, in Global Optimization and Constraint Satisfaction, Lecture Notes in Computer Science, C. Bliek, C. Jermann and A. Neumaier, eds., Vol. 2861, pp. 211–222, COCOS, Springer-Verlag, Berlin, Heidelberg, 2003.
   Google Scholar
• M. Tawarmalani and N.V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Kluwer Academic Publishers, Dordrecht, Netherlands, 2002.
   Google Scholar
• A. Wächter. Homepage of IPOPT, 2002. Available at https://projects.coin-or.org/Ipopt.
   Google Scholar