Skip to main content

2015 | OriginalPaper | Buchkapitel

Blackbox Optimization in Engineering Design: Adaptive Statistical Surrogates and Direct Search Algorithms

verfasst von : Bastien Talgorn, Le Digabel Sébastien, Michael Kokkolaras

Erschienen in: Engineering and Applied Sciences Optimization

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Simulation-based design optimization relies on computational models to evaluate objective and constraint functions. Typical challenges of solving simulation-based design optimization problems include unavailable gradients or unreliable approximations thereof, excessive computational cost, numerical noise, multi-modality and even the models’ failure to return a value. It has become common to use the term “blackbox” for a computational model that features any of these characteristics and/or is inaccessible by the design engineer (i.e., cannot be modified directly to address these issues). A possible remedy for dealing with blackboxes is to use surrogate-based derivative-free optimization methods. However, this has to be done carefully using appropriate formulations and algorithms. In this work, we use the R dynaTree package to build statistical surrogates of the blackboxes and the direct search method for derivative-free optimization. We present different formulations for the surrogate problem considered at each search step of the Mesh Adaptive Direct Search (MADS) algorithm using a surrogate management framework. The proposed formulations are tested on two simulation-based multidisciplinary design optimization problems. Numerical results confirm that the use of statistical surrogates in MADS improves the efficiency of the optimization algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
There may be situations where the properties of the objective function or some of the constraints do not require the construction and use of surrogate models, e.g., if one of these functions is smooth and inexpensive and has an analytical expression.
 
Literatur
2.
Zurück zum Zitat AIAA/UTC/Pratt & Whitney. Undergraduate individual aircraft design competition, 1995/1996 AIAA/UTC/Pratt & Whitney. Undergraduate individual aircraft design competition, 1995/1996
4.
Zurück zum Zitat Audet C, Dennis JE Jr (2006) Mesh adaptive direct search algorithms for constrained optimization. SIAM J Optim 17(1):188–217CrossRefMATHMathSciNet Audet C, Dennis JE Jr (2006) Mesh adaptive direct search algorithms for constrained optimization. SIAM J Optim 17(1):188–217CrossRefMATHMathSciNet
5.
Zurück zum Zitat Audet C, Béchard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J Glob Optim 41(2):299–318CrossRefMATH Audet C, Béchard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J Glob Optim 41(2):299–318CrossRefMATH
6.
Zurück zum Zitat Bai Z (2002) Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems. Appl Numer Math 43(1–2):9–44CrossRefMATHMathSciNet Bai Z (2002) Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems. Appl Numer Math 43(1–2):9–44CrossRefMATHMathSciNet
7.
Zurück zum Zitat Bandler JW, Cheng QS, Dakroury SA, Mohamed AS, Bakr MH, Madsen K, Sondergaard J (2004) Space mapping: the state of the art. IEEE Trans Microw Theory Tech 52(1):337–361CrossRef Bandler JW, Cheng QS, Dakroury SA, Mohamed AS, Bakr MH, Madsen K, Sondergaard J (2004) Space mapping: the state of the art. IEEE Trans Microw Theory Tech 52(1):337–361CrossRef
8.
Zurück zum Zitat Booker AJ, Dennis JE Jr, Frank PD, Serafini DB, Torczon V, Trosset MW (1999) A rigorous framework for optimization of expensive functions by surrogates. Struct Multi Optim 17(1):1–13 Booker AJ, Dennis JE Jr, Frank PD, Serafini DB, Torczon V, Trosset MW (1999) A rigorous framework for optimization of expensive functions by surrogates. Struct Multi Optim 17(1):1–13
9.
10.
Zurück zum Zitat Carvalho CM, Lopes HF, Polson NG, Taddy MA (2010) Particle learning for general mixtures. Bayesian Anal 5(4):709–740CrossRefMathSciNet Carvalho CM, Lopes HF, Polson NG, Taddy MA (2010) Particle learning for general mixtures. Bayesian Anal 5(4):709–740CrossRefMathSciNet
11.
Zurück zum Zitat Chipman HA, George EI, McCulloch RE (1998) Bayesian CART model search (with discussion). J Am Stat Assoc 93(443):935–960CrossRef Chipman HA, George EI, McCulloch RE (1998) Bayesian CART model search (with discussion). J Am Stat Assoc 93(443):935–960CrossRef
12.
Zurück zum Zitat Chipman HA, George EI, McCulloch RE (2002) Bayesian treed models. Mach Learn 48(1–3):299–320 Chipman HA, George EI, McCulloch RE (2002) Bayesian treed models. Mach Learn 48(1–3):299–320
13.
Zurück zum Zitat Clarke FH Optimization and nonsmooth analysis. Wiley, New York, 1983. Reissued in 1990 by SIAM Publications, Philadelphia, as, vol 5 in the series Classics in Applied Mathematics Clarke FH Optimization and nonsmooth analysis. Wiley, New York, 1983. Reissued in 1990 by SIAM Publications, Philadelphia, as, vol 5 in the series Classics in Applied Mathematics
14.
Zurück zum Zitat Cohn DA (1996) Neural network exploration using optimal experimental design. Adv Neural Inf Process Syst 6(9):679–686 Cohn DA (1996) Neural network exploration using optimal experimental design. Adv Neural Inf Process Syst 6(9):679–686
15.
Zurück zum Zitat Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. MOS/SIAM series on optimization. SIAM, PhiladelphiaCrossRef Conn AR, Scheinberg K, Vicente LN (2009) Introduction to derivative-free optimization. MOS/SIAM series on optimization. SIAM, PhiladelphiaCrossRef
16.
Zurück zum Zitat Conn AR, Le Digabel S (2013) Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim Methods Softw 28(1):139–158CrossRefMATHMathSciNet Conn AR, Le Digabel S (2013) Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim Methods Softw 28(1):139–158CrossRefMATHMathSciNet
17.
Zurück zum Zitat Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20(3):273–297MATH
18.
Zurück zum Zitat Custódio AL, Rocha H, Vicente LN (2010) Incorporating minimum Frobenius norm models in direct search. Comput Optim Appl 46(2):265–278CrossRefMATHMathSciNet Custódio AL, Rocha H, Vicente LN (2010) Incorporating minimum Frobenius norm models in direct search. Comput Optim Appl 46(2):265–278CrossRefMATHMathSciNet
20.
Zurück zum Zitat Forrester AIJ, Keane AJ (2009) Recent advances in surrogate-based optimization. Prog Aerosp Sci 45(1–3):50–79CrossRef Forrester AIJ, Keane AJ (2009) Recent advances in surrogate-based optimization. Prog Aerosp Sci 45(1–3):50–79CrossRef
21.
Zurück zum Zitat Goldberg DE (1989) Genetic algorithms in search. optimization and machine learning. Wesley, BostonMATH Goldberg DE (1989) Genetic algorithms in search. optimization and machine learning. Wesley, BostonMATH
22.
Zurück zum Zitat Gramacy RB, Le Digabel S (2011) The mesh adaptive direct search algorithm with treed Gaussian process surrogates. Technical Report G-2011-37, Les cahiers du GERAD, 2011. To appear in the Pac J Optim Gramacy RB, Le Digabel S (2011) The mesh adaptive direct search algorithm with treed Gaussian process surrogates. Technical Report G-2011-37, Les cahiers du GERAD, 2011. To appear in the Pac J Optim
24.
Zurück zum Zitat Gramacy RB, Lee HKH (2008) Bayesian treed Gaussian process models with an application to computer modeling. J Am Stat Assoc 103(483):1119–1130CrossRefMATHMathSciNet Gramacy RB, Lee HKH (2008) Bayesian treed Gaussian process models with an application to computer modeling. J Am Stat Assoc 103(483):1119–1130CrossRefMATHMathSciNet
25.
Zurück zum Zitat Gramacy RB, Taddy MA, Wild SM (2013) Variable selection and sensitivity analysis using dynamic trees, with an application to computer code performance tuning. Ann Appl Stat 7(1):51–80CrossRefMATHMathSciNet Gramacy RB, Taddy MA, Wild SM (2013) Variable selection and sensitivity analysis using dynamic trees, with an application to computer code performance tuning. Ann Appl Stat 7(1):51–80CrossRefMATHMathSciNet
26.
Zurück zum Zitat Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black box functions. J Glob Optim 13(4):455–492CrossRefMATHMathSciNet Jones DR, Schonlau M, Welch WJ (1998) Efficient global optimization of expensive black box functions. J Glob Optim 13(4):455–492CrossRefMATHMathSciNet
27.
Zurück zum Zitat Jones DR (2001) A taxonomy of global optimization methods based on response surfaces. J Glob Optim 21:345–383 Jones DR (2001) A taxonomy of global optimization methods based on response surfaces. J Glob Optim 21:345–383
28.
Zurück zum Zitat Kodiyalam S (2001) Multidisciplinary aerospace systems optimization. Technical Report NASA/CR-2001-211053, Lockheed Martin Space Systems Company, Computational AeroSciences Project, Sunnyvale, CA Kodiyalam S (2001) Multidisciplinary aerospace systems optimization. Technical Report NASA/CR-2001-211053, Lockheed Martin Space Systems Company, Computational AeroSciences Project, Sunnyvale, CA
29.
Zurück zum Zitat Krige DG (1951) A statistical approach to some mine valuations and allied problems at the Witwatersrand. Master’s thesis, University of Witwatersrand Krige DG (1951) A statistical approach to some mine valuations and allied problems at the Witwatersrand. Master’s thesis, University of Witwatersrand
30.
Zurück zum Zitat Le Digabel S (2011) Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans Math Softw 37(4):44:1–44:15 Le Digabel S (2011) Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans Math Softw 37(4):44:1–44:15
31.
Zurück zum Zitat Liem RP (2007) Surrogate modeling for large-scale black-box systems. Master’s thesis, School of Engineering, Computation for Design and Optimization Program Liem RP (2007) Surrogate modeling for large-scale black-box systems. Master’s thesis, School of Engineering, Computation for Design and Optimization Program
32.
Zurück zum Zitat McKay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2):239–245MATHMathSciNet McKay MD, Beckman RJ, Conover WJ (1979) A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2):239–245MATHMathSciNet
34.
Zurück zum Zitat Queipo N, Haftka R, Shyy W, Goel T, Vaidyanathan R, Kevintucker P (2005) Surrogate-based analysis and optimization. Prog Aerosp Sci 41(1):1–28CrossRef Queipo N, Haftka R, Shyy W, Goel T, Vaidyanathan R, Kevintucker P (2005) Surrogate-based analysis and optimization. Prog Aerosp Sci 41(1):1–28CrossRef
35.
Zurück zum Zitat Rasmussen CE, Williams CKI (2006) Gaussian processes for machine learning. The MIT Press, Cambridge Rasmussen CE, Williams CKI (2006) Gaussian processes for machine learning. The MIT Press, Cambridge
36.
Zurück zum Zitat Schonlau M, Jones DR, Welch WJ (1998) Global versus local search in constrained optimization of computer models. In: New developments and applications in experimental design, number 34 in IMS Lecture Notes–Monograph Series, pp 11–25. Institute of Mathematical Statistics Schonlau M, Jones DR, Welch WJ (1998) Global versus local search in constrained optimization of computer models. In: New developments and applications in experimental design, number 34 in IMS Lecture Notes–Monograph Series, pp 11–25. Institute of Mathematical Statistics
37.
Zurück zum Zitat Serafini DB (1998) A framework for managing models in nonlinear optimization of computationally expensive functions. Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, Texas Serafini DB (1998) A framework for managing models in nonlinear optimization of computationally expensive functions. Ph.D. thesis, Department of Computational and Applied Mathematics, Rice University, Houston, Texas
38.
Zurück zum Zitat Simpson TW, Korte JJ, Mauery TM, Mistree F (2001) Kriging models for global approximation in simulation-based multidisciplinary design optimization. AIAA J 39(12):2233–2241CrossRef Simpson TW, Korte JJ, Mauery TM, Mistree F (2001) Kriging models for global approximation in simulation-based multidisciplinary design optimization. AIAA J 39(12):2233–2241CrossRef
39.
Zurück zum Zitat Taddy MA, Gramacy RB, Polson NG (2011) Dynamic trees for learning and design. J Am Stat Assoc 106(493):109–123CrossRefMathSciNet Taddy MA, Gramacy RB, Polson NG (2011) Dynamic trees for learning and design. J Am Stat Assoc 106(493):109–123CrossRefMathSciNet
41.
Zurück zum Zitat Tribes C, Dubé J-F, Trépanier J-Y (2005) Decomposition of multidisciplinary optimization problems: formulations and application to a simplified wing design. Eng Optim 37(8):775–796 Tribes C, Dubé J-F, Trépanier J-Y (2005) Decomposition of multidisciplinary optimization problems: formulations and application to a simplified wing design. Eng Optim 37(8):775–796
42.
Zurück zum Zitat Vaz AIF, Vicente LN (2007) A particle swarm pattern search method for bound constrained global optimization. J Glob Optim 39(2):197–219CrossRefMATHMathSciNet Vaz AIF, Vicente LN (2007) A particle swarm pattern search method for bound constrained global optimization. J Glob Optim 39(2):197–219CrossRefMATHMathSciNet
43.
Zurück zum Zitat Willcox K, Peraire J (2002) Balanced model reduction via the proper orthogonal decomposition. AIAA J 40(11):2323–2330CrossRef Willcox K, Peraire J (2002) Balanced model reduction via the proper orthogonal decomposition. AIAA J 40(11):2323–2330CrossRef
44.
Zurück zum Zitat Williams BJ, Santner TJ, Notz WI (2000) Sequential design of computer experiments to minimize integrated response functions. Stat Sin 10(4):1133–1152MATHMathSciNet Williams BJ, Santner TJ, Notz WI (2000) Sequential design of computer experiments to minimize integrated response functions. Stat Sin 10(4):1133–1152MATHMathSciNet
Metadaten
Titel
Blackbox Optimization in Engineering Design: Adaptive Statistical Surrogates and Direct Search Algorithms
verfasst von
Bastien Talgorn
Le Digabel Sébastien
Michael Kokkolaras
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-18320-6_19

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.