Improving Efficiency of a Multistart with Interrupted Hooke-and-Jeeves Filter Search for Solving MINLP Problems
- 1 Mentions
- 875 Downloads
Abstract
This paper addresses the problem of solving mixed-integer nonlinear programming (MINLP) problems by a multistart strategy that invokes a derivative-free local search procedure based on a filter set methodology to handle nonlinear constraints. A new concept of componentwise normalized distance aiming to discard randomly generated points that are sufficiently close to other points already used to invoke the local search is analyzed. A variant of the Hooke-and-Jeeves filter algorithm for MINLP is proposed with the goal of interrupting the iterative process if the accepted iterate falls inside an \(\epsilon \)-neighborhood of an already computed minimizer. Preliminary numerical results are included.
Keywords
nonconvex MINLP Multistart Hooke-and-Jeeves Filter methodNotes
Acknowledgments
The authors wish to thank two anonymous referees for their comments and suggestions. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Fundação para a Ciência e Tecnologia, within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.
References
- 1.Abramson, M.A., Audet, C., Chrissis, J.W., Walston, J.G.: Mesh adaptive direct search algorithms for mixed variable optimization. Optim. Lett. 3, 35–47 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
- 2.Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., Mahajan, A.: Mixed-Integer Nonlinear Optimization. Acta Numer. 22, 1–131 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
- 3.Burer, S., Letchford, A.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manage. Sci. 17, 97–106 (2012)MathSciNetGoogle Scholar
- 4.Gueddar, T., Dua, V.: Approximate multi-parametric programming based B&B algorithm for MINLPs. Comput. Chem. Eng. 42, 288–297 (2012)CrossRefGoogle Scholar
- 5.Liuzzi, G., Lucidi, S., Rinaldi, F.: Derivative-free methods for mixed-integer constrained optimization problems. J. Optimiz. Theory App. 164(3), 933–965 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
- 6.Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization. CDFO. Eur. J. Oper. Res. 252, 701–727 (2016)MathSciNetCrossRefGoogle Scholar
- 7.Hedar, A., Fahim, A.: Filter-based genetic algorithm for mixed variable programming. Numer. Algebra Control Optim. 1(1), 99–116 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
- 8.Schlüter, M., Egea, J.A., Banga, J.R.: Extended ant colony optimization for non-convex mixed integer nonlinear programming. Comput. Oper. Res. 36, 2217–2229 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
- 9.Lin, Y.C., Hwang, K.S.: A mixed-coding scheme of evolutionary algorithms to solve mixed-integer nonlinear programming problems. Comput. Math. Appl. 47, 1295–1307 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
- 10.Abramson, M.A., Audet, C., Dennis Jr., J.E.: Filter pattern search algorithms for mixed variable constrained optimization problems. Pac. J. Optim. 3(3), 477–500 (2007)MathSciNetzbMATHGoogle Scholar
- 11.Costa, M.F.P., Fernandes, F.P., Fernandes, E.M.G.P., Rocha, A.M.A.C.: Multiple solutions of mixed variable optimization by multistart Hooke and Jeeves filter method. Appl. Math. Sci. 8(44), 2163–2179 (2014)MathSciNetGoogle Scholar
- 12.Fernandes, F.P., Costa, M.F.P., Fernandes, E., Rocha, A.: Multistart Hooke and Jeeves filter method for mixed variable optimization. In: Simos, T.E., Psihoyios, G., Tsitouras, C. (eds.) ICNAAM 2013, AIP Conference Proceeding, vol. 1558, pp. 614–617 (2013)Google Scholar
- 13.Liao, T.W.: Two hybrid differential evolution algorithms for engineering design optimization. Appl. Soft Comput. 10(4), 1188–1199 (2010)CrossRefGoogle Scholar
- 14.Voglis, C., Lagaris, I.E.: Towards “Ideal Multistart”. A stochastic approach for locating the minima of a continuous function inside a bounded domain. Appl. Math. Comput. 213, 1404–1415 (2009)MathSciNetzbMATHGoogle Scholar
- 15.Hooke, R., Jeeves, T.A.: Direct search solution of numerical and statistical problems. J. Assoc. Comput. 8, 212–229 (1961)CrossRefzbMATHGoogle Scholar
- 16.Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385–482 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
- 17.Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239–269 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
- 18.Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optimiz. 14(4), 980–1010 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
- 19.Tsoulos, I.G., Stavrakoudis, A.: On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods. Nonlinear Anal. Real World Appl. 11, 2465–2471 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
- 20.Tsoulos, I.G., Lagaris, I.E.: MinFinder: Locating all the local minima of a function. Comput. Phys. Commun. 174, 166–179 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
- 21.Lagaris, I.E., Tsoulos, I.G.: Stopping rules for box-constrained stochastic global optimization. Appl. Math. Comput. 197, 622–632 (2008)MathSciNetzbMATHGoogle Scholar
- 22.Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551–566 (1995)CrossRefGoogle Scholar