Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization
Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer simulation. The subject of this work is the mesh adaptive direct search ( mads ) class of algorithms for blackbox optimization. We propose a way t...
Saved in:
Published in | Optimization and engineering Vol. 17; no. 2; pp. 333 - 358 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
Springer US
01.06.2016
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
ISSN | 1389-4420 1573-2924 |
DOI | 10.1007/s11081-015-9283-0 |
Cover
Abstract | Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer simulation. The subject of this work is the mesh adaptive direct search (
mads
) class of algorithms for blackbox optimization. We propose a way to dynamically scale the mesh, which is the discrete spatial structure on which
mads
relies, so that it automatically adapts to the characteristics of the problem to solve. Another objective of the paper is to revisit the
mads
method in order to ease its presentation and to reflect recent developments. This new presentation includes a nonsmooth convergence analysis. Finally, numerical tests are conducted to illustrate the efficiency of the dynamic scaling, both on academic test problems and on a supersonic business jet design problem. |
---|---|
AbstractList | Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer simulation. The subject of this work is the mesh adaptive direct search (mads) class of algorithms for blackbox optimization. We propose a way to dynamically scale the mesh, which is the discrete spatial structure on which mads relies, so that it automatically adapts to the characteristics of the problem to solve. Another objective of the paper is to revisit the mads method in order to ease its presentation and to reflect recent developments. This new presentation includes a nonsmooth convergence analysis. Finally, numerical tests are conducted to illustrate the efficiency of the dynamic scaling, both on academic test problems and on a supersonic business jet design problem. Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer simulation. The subject of this work is the mesh adaptive direct search ( mads ) class of algorithms for blackbox optimization. We propose a way to dynamically scale the mesh, which is the discrete spatial structure on which mads relies, so that it automatically adapts to the characteristics of the problem to solve. Another objective of the paper is to revisit the mads method in order to ease its presentation and to reflect recent developments. This new presentation includes a nonsmooth convergence analysis. Finally, numerical tests are conducted to illustrate the efficiency of the dynamic scaling, both on academic test problems and on a supersonic business jet design problem. |
Author | Audet, Charles Le Digabel, Sébastien Tribes, Christophe |
Author_xml | – sequence: 1 givenname: Charles surname: Audet fullname: Audet, Charles organization: Département de mathématiques et génie industriel, GERAD, École Polytechnique de Montréal – sequence: 2 givenname: Sébastien surname: Le Digabel fullname: Le Digabel, Sébastien organization: Département de mathématiques et génie industriel, GERAD, École Polytechnique de Montréal – sequence: 3 givenname: Christophe surname: Tribes fullname: Tribes, Christophe email: christophe.tribes@polymtl.ca organization: Département de mathématiques et génie industriel, GERAD, École Polytechnique de Montréal |
BookMark | eNp9kM1OGzEURq0KpCbAA7Cz1A2bKb72_NjLitIWKVI3wNbyOHcS0xk72E4FfXocUgkpEqxsWee7_u6ZkyMfPBJyDuwrMNZdJgAmoWLQVIpLUbFPZAZNJyqueH1U7kKqqq45-0zmKT0wBm3D5Yzcf3_2ZnKWJmtG51fUeZrXSCdMa2qWZpPdX6RLF9FmmtBEW57HVYguryc6hEj70dg_fXiiobCT-2eyC_6UHA9mTHj2_zwhdz-ub69-VYvfP2-uvi0qK2qVKyFYw3vRK4ktqs6qhnXQGhSNqmE5lIZ8qBU3KG0LfQ8d2mGJNQo1WDbIXpyQi_3cTQyPW0xZTy5ZHEfjMWyTBimapmNl74J-OUAfwjb60k5z1gopAJQsFOwpG0NKEQe9iW4y8VkD0zvTem9aF9N6Z1rvJncHGevyq4YcjRs_TPJ9MpVf_ArjW6f3Qy9Sd5RI |
CitedBy_id | crossref_primary_10_1137_21M1420915 crossref_primary_10_1002_ett_3572 crossref_primary_10_1016_j_ejco_2021_100011 crossref_primary_10_1137_18M1175872 crossref_primary_10_1016_j_procir_2017_03_190 crossref_primary_10_1007_s10589_021_00267_6 crossref_primary_10_1007_s10589_021_00272_9 crossref_primary_10_1109_ACCESS_2018_2877695 crossref_primary_10_1145_3544489 crossref_primary_10_1007_s10589_020_00249_0 crossref_primary_10_1007_s11081_020_09483_1 crossref_primary_10_1007_s10589_018_0016_0 crossref_primary_10_1007_s43069_021_00075_y |
Cites_doi | 10.1137/040603371 10.1214/aoms/1177692644 10.1137/S003614450242889 10.1145/1916461.1916468 10.1137/080716980 10.1080/10556788.2011.623162 10.1007/s10898-012-9944-x 10.1007/s10589-009-9266-1 10.1017/CBO9780511626418 10.1137/0804044 10.1023/B:OPTE.0000033370.66768.a9 10.1007/s10957-013-0356-y 10.1137/080724083 10.1137/S1064827599365823 10.1090/conm/047/828319 10.1137/S1052623493250780 10.1023/A:1026429319405 10.1007/BF01386213 10.1007/s10898-007-9234-1 10.1137/070707518 10.1137/120895056 10.1115/1.4001346 10.1137/1.9780898718768 10.1137/070692662 10.1007/s10107-010-0429-8 10.1137/S1052623400370606 10.1137/S1052623497330392 10.1007/b98874 10.1007/s11590-013-0688-4 10.1214/aoms/1177706645 10.1016/S0305-0548(97)00031-2 10.1137/S1052623403433638 10.1007/s10589-014-9687-3 10.1137/1.9781611971200 10.4271/1999-01-5622 |
ContentType | Journal Article |
Copyright | Springer Science+Business Media New York 2015 Copyright Springer Science & Business Media 2016 |
Copyright_xml | – notice: Springer Science+Business Media New York 2015 – notice: Copyright Springer Science & Business Media 2016 |
DBID | AAYXX CITATION 7TB 8FD FR3 KR7 |
DOI | 10.1007/s11081-015-9283-0 |
DatabaseName | CrossRef Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts |
DatabaseTitle | CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Mechanical & Transportation Engineering Abstracts |
DatabaseTitleList | Civil Engineering Abstracts Civil Engineering Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Mathematics |
EISSN | 1573-2924 |
EndPage | 358 |
ExternalDocumentID | 10_1007_s11081_015_9283_0 |
GroupedDBID | -5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 123 1N0 1SB 203 29N 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFSI ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFO ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFGCZ AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q N9A NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9R PF0 PT4 Q2X QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7S Z7X Z7Y Z7Z Z83 Z88 ZMTXR ~A9 AAPKM AAYXX ABBRH ABDBE ABFSG ACMFV ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION 7TB 8FD ABRTQ FR3 KR7 |
ID | FETCH-LOGICAL-c349t-33052b3b98e6e97c950716ae35941df5282f492ae8c61bb17ecfde4e39fc0f8b3 |
IEDL.DBID | U2A |
ISSN | 1389-4420 |
IngestDate | Thu Sep 04 22:02:44 EDT 2025 Fri Jul 25 11:08:59 EDT 2025 Tue Jul 01 00:40:00 EDT 2025 Thu Apr 24 23:08:58 EDT 2025 Fri Feb 21 02:33:05 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 2 |
Keywords | 62P30 Mesh adaptive direct search 90C30 65K05 90C56 Blackbox optimization Dynamic scaling Derivative-free optimization |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c349t-33052b3b98e6e97c950716ae35941df5282f492ae8c61bb17ecfde4e39fc0f8b3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
PQID | 2063831198 |
PQPubID | 326265 |
PageCount | 26 |
ParticipantIDs | proquest_miscellaneous_1835570420 proquest_journals_2063831198 crossref_primary_10_1007_s11081_015_9283_0 crossref_citationtrail_10_1007_s11081_015_9283_0 springer_journals_10_1007_s11081_015_9283_0 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2016-06-01 |
PublicationDateYYYYMMDD | 2016-06-01 |
PublicationDate_xml | – month: 06 year: 2016 text: 2016-06-01 day: 01 |
PublicationDecade | 2010 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York – name: Dordrecht |
PublicationSubtitle | International Multidisciplinary Journal to Promote Optimization Theory & Applications in Engineering Sciences |
PublicationTitle | Optimization and engineering |
PublicationTitleAbbrev | Optim Eng |
PublicationYear | 2016 |
Publisher | Springer US Springer Nature B.V |
Publisher_xml | – name: Springer US – name: Springer Nature B.V |
References | Lucidi, Sciandrone (CR27) 2002; 13 Tosserams, Kokkolaras, Etman, Rooda (CR36) 2010; 132 García-Palomares, Rodríguez (CR18) 2002; 13 Mladenović, Hansen (CR31) 1997; 24 CR16 Hough, Kolda, Torczon (CR22) 2001; 23 Conn, Le Digabel (CR12) 2013; 28 Audet (CR4) 2004; 5 Box, Muller (CR11) 1958; 29 Audet, Dennis, Le Digabel (CR9) 2010; 46 Torczon (CR35) 1997; 7 Halton (CR21) 1960; 2 Audet, Béchard, Le Digabel (CR5) 2008; 41 Audet, Dennis (CR7) 2009; 20 McKay, Beckman, Conover (CR30) 1979; 21 Van Loan (CR38) 1985; 47 Abramson, Audet, Dennis, Le Digabel (CR1) 2009; 20 Kolda, Lewis, Torczon (CR24) 2006; 17 CR3 Audet, Dennis, Le Digabel (CR8) 2008; 19 Audet, Ianni, Le Digabel, Tribes (CR10) 2014; 24 Audet, Dennis (CR6) 2006; 17 Martínez, Sobral (CR29) 2013; 56 Nocedal, Wright (CR33) 1999 Conn, Scheinberg, Vicente (CR13) 2009 Coope, Price (CR14) 2000; 107 CR20 Gill, Murray, Wright (CR19) 1981 Moré, Wild (CR32) 2009; 20 Papalambros, Wilde (CR34) 2000 Van Dyke, Asaki (CR37) 2013; 159 Vicente, Custódio (CR39) 2012; 133 Le Digabel (CR25) 2011; 37 Liseikin (CR26) 2009 Marsaglia (CR28) 1972; 43 Cramer, Dennis, Frank, Lewis, Shubin (CR15) 1994; 4 Fletcher (CR17) 1980 Kolda, Lewis, Torczon (CR23) 2003; 45 Adjengue, Audet, Ben, Yahia (CR2) 2014; 8 L Adjengue (9283_CR2) 2014; 8 CF Loan Van (9283_CR38) 1985; 47 LN Vicente (9283_CR39) 2012; 133 JJ Moré (9283_CR32) 2009; 20 JM Martínez (9283_CR29) 2013; 56 C Audet (9283_CR9) 2010; 46 MD McKay (9283_CR30) 1979; 21 C Audet (9283_CR4) 2004; 5 ID Coope (9283_CR14) 2000; 107 9283_CR20 V Torczon (9283_CR35) 1997; 7 GEP Box (9283_CR11) 1958; 29 S Lucidi (9283_CR27) 2002; 13 C Audet (9283_CR5) 2008; 41 AR Conn (9283_CR13) 2009 MA Abramson (9283_CR1) 2009; 20 G Marsaglia (9283_CR28) 1972; 43 PY Papalambros (9283_CR34) 2000 S Tosserams (9283_CR36) 2010; 132 R Fletcher (9283_CR17) 1980 9283_CR3 PE Gill (9283_CR19) 1981 J Nocedal (9283_CR33) 1999 UM García-Palomares (9283_CR18) 2002; 13 C Audet (9283_CR10) 2014; 24 C Audet (9283_CR7) 2009; 20 JH Halton (9283_CR21) 1960; 2 AR Conn (9283_CR12) 2013; 28 9283_CR16 VD Liseikin (9283_CR26) 2009 C Audet (9283_CR6) 2006; 17 EJ Cramer (9283_CR15) 1994; 4 TG Kolda (9283_CR23) 2003; 45 B Dyke Van (9283_CR37) 2013; 159 S Le Digabel (9283_CR25) 2011; 37 C Audet (9283_CR8) 2008; 19 N Mladenović (9283_CR31) 1997; 24 TG Kolda (9283_CR24) 2006; 17 PD Hough (9283_CR22) 2001; 23 |
References_xml | – volume: 17 start-page: 188 issue: 1 year: 2006 end-page: 217 ident: CR6 article-title: Mesh adaptive direct search algorithms for constrained optimization publication-title: SIAM J Optim doi: 10.1137/040603371 – volume: 43 start-page: 645 issue: 2 year: 1972 end-page: 646 ident: CR28 article-title: Choosing a point from the surface of a sphere publication-title: Ann Math Stat doi: 10.1214/aoms/1177692644 – year: 1981 ident: CR19 publication-title: Practical optimization – volume: 45 start-page: 385 issue: 3 year: 2003 end-page: 482 ident: CR23 article-title: Optimization by direct search: new perspectives on some classical and modern methods publication-title: SIAM Rev doi: 10.1137/S003614450242889 – volume: 37 start-page: 44:1 issue: 4 year: 2011 end-page: 44:15 ident: CR25 article-title: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm publication-title: ACM Trans Math Softw doi: 10.1145/1916461.1916468 – volume: 20 start-page: 948 issue: 2 year: 2009 end-page: 966 ident: CR1 article-title: OrthoMADS: a deterministic MADS instance with orthogonal directions publication-title: SIAM J Optim doi: 10.1137/080716980 – volume: 28 start-page: 139 issue: 1 year: 2013 end-page: 158 ident: CR12 article-title: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization publication-title: Optim Methods Softw doi: 10.1080/10556788.2011.623162 – volume: 56 start-page: 1217 issue: 3 year: 2013 end-page: 1232 ident: CR29 article-title: Constrained derivative-free optimization on thin domains publication-title: J Glob Optim doi: 10.1007/s10898-012-9944-x – volume: 46 start-page: 193 issue: 2 year: 2010 end-page: 215 ident: CR9 article-title: Globalization strategies for mesh adaptive direct search publication-title: Comput Optim Appl doi: 10.1007/s10589-009-9266-1 – ident: CR16 – year: 2009 ident: CR26 publication-title: Grid generation methods – year: 2000 ident: CR34 publication-title: Principles of optimal design: modeling and computation doi: 10.1017/CBO9780511626418 – volume: 4 start-page: 754 issue: 4 year: 1994 end-page: 776 ident: CR15 article-title: Problem formulation for multidisciplinary optimization publication-title: SIAM J Optim doi: 10.1137/0804044 – volume: 5 start-page: 101 issue: 2 year: 2004 end-page: 122 ident: CR4 article-title: Convergence results for generalized pattern search algorithms are tight publication-title: Optim Eng doi: 10.1023/B:OPTE.0000033370.66768.a9 – volume: 159 start-page: 805 issue: 3 year: 2013 end-page: 821 ident: CR37 article-title: Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions publication-title: J Optim Theory Appl doi: 10.1007/s10957-013-0356-y – volume: 20 start-page: 172 issue: 1 year: 2009 end-page: 191 ident: CR32 article-title: Benchmarking derivative-free optimization algorithms publication-title: SIAM J Optim doi: 10.1137/080724083 – volume: 23 start-page: 134 issue: 1 year: 2001 end-page: 156 ident: CR22 article-title: Asynchronous parallel pattern search for nonlinear optimization publication-title: SIAM J Sci Comput doi: 10.1137/S1064827599365823 – volume: 47 start-page: 465 year: 1985 end-page: 478 ident: CR38 article-title: How near is a stable matrix to an unstable matrix publication-title: Contemp Math doi: 10.1090/conm/047/828319 – volume: 7 start-page: 1 issue: 1 year: 1997 end-page: 25 ident: CR35 article-title: On the convergence of pattern search algorithms publication-title: SIAM J Optim doi: 10.1137/S1052623493250780 – volume: 107 start-page: 261 issue: 2 year: 2000 end-page: 274 ident: CR14 article-title: Frame-based methods for unconstrained optimization publication-title: J Optim Theory Appl doi: 10.1023/A:1026429319405 – volume: 2 start-page: 84 issue: 1 year: 1960 end-page: 90 ident: CR21 article-title: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals publication-title: Numer Math doi: 10.1007/BF01386213 – volume: 41 start-page: 299 issue: 2 year: 2008 end-page: 318 ident: CR5 article-title: Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search publication-title: J Glob Optim doi: 10.1007/s10898-007-9234-1 – volume: 19 start-page: 1150 issue: 3 year: 2008 end-page: 1170 ident: CR8 article-title: Parallel space decomposition of the mesh adaptive direct search algorithm publication-title: SIAM J Optim doi: 10.1137/070707518 – volume: 24 start-page: 621 issue: 2 year: 2014 end-page: 642 ident: CR10 article-title: Reducing the number of function evaluations in mesh adaptive direct search algorithms publication-title: SIAM J Optim doi: 10.1137/120895056 – volume: 132 start-page: 051002-1 issue: 5 year: 2010 end-page: 051002-13 ident: CR36 article-title: A non-hierarchical formulation of analytical target cascading publication-title: J Mech Des doi: 10.1115/1.4001346 – ident: CR3 – year: 2009 ident: CR13 publication-title: Introduction to derivative-free optimization. MOS-SIAM series on optimization doi: 10.1137/1.9780898718768 – volume: 20 start-page: 445 issue: 1 year: 2009 end-page: 472 ident: CR7 article-title: A Progressive Barrier for Derivative-Free Nonlinear Programming publication-title: SIAM J Optim doi: 10.1137/070692662 – volume: 133 start-page: 299 issue: 1–2 year: 2012 end-page: 325 ident: CR39 article-title: Analysis of direct searches for discontinuous functions publication-title: Math Programm doi: 10.1007/s10107-010-0429-8 – volume: 13 start-page: 79 issue: 1 year: 2002 end-page: 96 ident: CR18 article-title: New sequential and parallel derivative-free algorithms for unconstrained optimization publication-title: SIAM J Optim doi: 10.1137/S1052623400370606 – volume: 13 start-page: 97 issue: 1 year: 2002 end-page: 116 ident: CR27 article-title: On the global convergence of derivative-free methods for unconstrained optimization publication-title: SIAM J Optim doi: 10.1137/S1052623497330392 – year: 1999 ident: CR33 publication-title: Numerical optimization doi: 10.1007/b98874 – volume: 8 start-page: 1599 issue: 5 year: 2014 end-page: 1610 ident: CR2 article-title: A variance-based method to rank input variables of the mesh adaptive direct search algorithm publication-title: Optim Lett doi: 10.1007/s11590-013-0688-4 – year: 1980 ident: CR17 publication-title: Practical methods of optimization, volume 1: unconstrained optimization – volume: 29 start-page: 610 issue: 2 year: 1958 end-page: 611 ident: CR11 article-title: A note on the generation of random normal deviates publication-title: Ann Math Stat doi: 10.1214/aoms/1177706645 – volume: 24 start-page: 1097 issue: 11 year: 1997 end-page: 1100 ident: CR31 article-title: Variable neighborhood search publication-title: Comput Oper Res doi: 10.1016/S0305-0548(97)00031-2 – ident: CR20 – volume: 17 start-page: 943 issue: 4 year: 2006 end-page: 968 ident: CR24 article-title: Stationarity results for generating set search for linearly constrained optimization publication-title: SIAM J Optim doi: 10.1137/S1052623403433638 – volume: 21 start-page: 239 issue: 2 year: 1979 end-page: 245 ident: CR30 article-title: A comparison of three methods for selecting values of input variables in the analysis of output from a computer code publication-title: Technometrics – volume: 20 start-page: 445 issue: 1 year: 2009 ident: 9283_CR7 publication-title: SIAM J Optim doi: 10.1137/070692662 – volume-title: Practical optimization year: 1981 ident: 9283_CR19 – volume-title: Numerical optimization year: 1999 ident: 9283_CR33 doi: 10.1007/b98874 – volume: 45 start-page: 385 issue: 3 year: 2003 ident: 9283_CR23 publication-title: SIAM Rev doi: 10.1137/S003614450242889 – volume-title: Principles of optimal design: modeling and computation year: 2000 ident: 9283_CR34 doi: 10.1017/CBO9780511626418 – volume: 5 start-page: 101 issue: 2 year: 2004 ident: 9283_CR4 publication-title: Optim Eng doi: 10.1023/B:OPTE.0000033370.66768.a9 – ident: 9283_CR20 doi: 10.1007/s10589-014-9687-3 – volume: 7 start-page: 1 issue: 1 year: 1997 ident: 9283_CR35 publication-title: SIAM J Optim doi: 10.1137/S1052623493250780 – volume: 2 start-page: 84 issue: 1 year: 1960 ident: 9283_CR21 publication-title: Numer Math doi: 10.1007/BF01386213 – volume: 132 start-page: 051002-1 issue: 5 year: 2010 ident: 9283_CR36 publication-title: J Mech Des doi: 10.1115/1.4001346 – volume: 41 start-page: 299 issue: 2 year: 2008 ident: 9283_CR5 publication-title: J Glob Optim doi: 10.1007/s10898-007-9234-1 – volume-title: Practical methods of optimization, volume 1: unconstrained optimization year: 1980 ident: 9283_CR17 – volume: 13 start-page: 79 issue: 1 year: 2002 ident: 9283_CR18 publication-title: SIAM J Optim doi: 10.1137/S1052623400370606 – volume: 107 start-page: 261 issue: 2 year: 2000 ident: 9283_CR14 publication-title: J Optim Theory Appl doi: 10.1023/A:1026429319405 – volume: 20 start-page: 172 issue: 1 year: 2009 ident: 9283_CR32 publication-title: SIAM J Optim doi: 10.1137/080724083 – volume: 133 start-page: 299 issue: 1–2 year: 2012 ident: 9283_CR39 publication-title: Math Programm doi: 10.1007/s10107-010-0429-8 – volume-title: Grid generation methods year: 2009 ident: 9283_CR26 – volume: 46 start-page: 193 issue: 2 year: 2010 ident: 9283_CR9 publication-title: Comput Optim Appl doi: 10.1007/s10589-009-9266-1 – volume: 29 start-page: 610 issue: 2 year: 1958 ident: 9283_CR11 publication-title: Ann Math Stat doi: 10.1214/aoms/1177706645 – volume: 28 start-page: 139 issue: 1 year: 2013 ident: 9283_CR12 publication-title: Optim Methods Softw doi: 10.1080/10556788.2011.623162 – volume: 19 start-page: 1150 issue: 3 year: 2008 ident: 9283_CR8 publication-title: SIAM J Optim doi: 10.1137/070707518 – volume: 23 start-page: 134 issue: 1 year: 2001 ident: 9283_CR22 publication-title: SIAM J Sci Comput doi: 10.1137/S1064827599365823 – volume: 4 start-page: 754 issue: 4 year: 1994 ident: 9283_CR15 publication-title: SIAM J Optim doi: 10.1137/0804044 – ident: 9283_CR16 doi: 10.1137/1.9781611971200 – volume-title: Introduction to derivative-free optimization. MOS-SIAM series on optimization year: 2009 ident: 9283_CR13 doi: 10.1137/1.9780898718768 – ident: 9283_CR3 doi: 10.4271/1999-01-5622 – volume: 43 start-page: 645 issue: 2 year: 1972 ident: 9283_CR28 publication-title: Ann Math Stat doi: 10.1214/aoms/1177692644 – volume: 37 start-page: 44:1 issue: 4 year: 2011 ident: 9283_CR25 publication-title: ACM Trans Math Softw doi: 10.1145/1916461.1916468 – volume: 8 start-page: 1599 issue: 5 year: 2014 ident: 9283_CR2 publication-title: Optim Lett doi: 10.1007/s11590-013-0688-4 – volume: 56 start-page: 1217 issue: 3 year: 2013 ident: 9283_CR29 publication-title: J Glob Optim doi: 10.1007/s10898-012-9944-x – volume: 21 start-page: 239 issue: 2 year: 1979 ident: 9283_CR30 publication-title: Technometrics – volume: 159 start-page: 805 issue: 3 year: 2013 ident: 9283_CR37 publication-title: J Optim Theory Appl doi: 10.1007/s10957-013-0356-y – volume: 24 start-page: 621 issue: 2 year: 2014 ident: 9283_CR10 publication-title: SIAM J Optim doi: 10.1137/120895056 – volume: 47 start-page: 465 year: 1985 ident: 9283_CR38 publication-title: Contemp Math doi: 10.1090/conm/047/828319 – volume: 24 start-page: 1097 issue: 11 year: 1997 ident: 9283_CR31 publication-title: Comput Oper Res doi: 10.1016/S0305-0548(97)00031-2 – volume: 13 start-page: 97 issue: 1 year: 2002 ident: 9283_CR27 publication-title: SIAM J Optim doi: 10.1137/S1052623497330392 – volume: 20 start-page: 948 issue: 2 year: 2009 ident: 9283_CR1 publication-title: SIAM J Optim doi: 10.1137/080716980 – volume: 17 start-page: 943 issue: 4 year: 2006 ident: 9283_CR24 publication-title: SIAM J Optim doi: 10.1137/S1052623403433638 – volume: 17 start-page: 188 issue: 1 year: 2006 ident: 9283_CR6 publication-title: SIAM J Optim doi: 10.1137/040603371 |
SSID | ssj0016528 |
Score | 2.1202354 |
Snippet | Blackbox optimization deals with situations in which the objective function and constraints are typically computed by launching a time-consuming computer... |
SourceID | proquest crossref springer |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 333 |
SubjectTerms | Adaptive algorithms Algorithms Business aircraft Computer simulation Control Design analysis Direct search algorithms Dynamics Engineering Environmental Management Financial Engineering Finite element method General aviation aircraft Launching Mathematical models Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Scaling Search algorithms Searching Systems Theory |
Title | Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization |
URI | https://link.springer.com/article/10.1007/s11081-015-9283-0 https://www.proquest.com/docview/2063831198 https://www.proquest.com/docview/1835570420 |
Volume | 17 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA-yveiD-InTKRF8UgJpkmbN49DNocwnJ_OpNG3qBls71g388730ayoq-FIouSZwl7v7pZe7Q-gqMpTHPKLE0dolwokM0dSFh8d4FImww5jNRh4-ycFIPIzdcZnHnVW33auQZG6pN8luDrgvOPq6RIFPJHBOb7pwdLfaOGLdOnQg3byhqg3AESFYHcr8aYqvzmiDML8FRXNf099DuyVIxN1CqvtoyyQHaOdT6UB4G9b1VrND9HJXNJbHGbAcxvE0wTCM5yab4CAKFtao4cJ94WJz42D2li6nq8kcA27F2v7I0-k7ToF2XiZnHqFRv_d8OyBlxwQScqFWhIP2Ms218ow0qhMqi_ZkYLirQAwxcIbFQrHAeKEE4TgdE8aREYarOKSxp_kxaiRpYk4QNrJDheNoqoNASE97NBLGlhcE6ykk9VqIVqzzw7KcuO1qMfM3hZAtt33gtm-57dMWuq4_WRS1NP4iblfy8Eu1ynxmARZ3HAXLX9bDoBA2yhEkJl1nPtgoW1YMJN9CN5UcN1P8uuDpv6jP0DZAJ1lcGmujxmq5NucAT1b6AjW796-PvYt8W34Ae6rccw |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwEA-iD-qD-InzM4JPSiBN0qx5FD-Yuu3Jyd5C06ZusLVj3cA_38v6MRUVfCmUpAncJXe_9HK_Q-gytpQnPKbEM8YnwostMdSHR8B4HIuoyZjLRu50Zasnnvp-v8zjzqvb7lVIcmGpl8luHrgvOPr6RIFPJHBOXwMsELiyBT12U4cOpL8oqOoCcEQIVocyfxriqzNaIsxvQdGFr3nYRlslSMQ3hVZ30IpNd9HmJ-pAeOvUfKv5Hnq9KwrL4xxEDu14mGJoxmObD3AYhxNn1HDhvnCxuHE4esumw9lgjAG3YuN-5JnsHWfQd1wmZ-6j3sP9y22LlBUTSMSFmhEOu5cZblRgpVXNSDm0J0PLfQVqSEAyLBGKhTaIJCjHa9ooia2wXCURTQLDD9BqmqX2EGErm1R4nqEmDIUMTEBjYR29IFhPIWnQQLQSnY5KOnFX1WKkl0TITtoapK2dtDVtoKv6k0nBpfFX55NKH7rcVrlmDmBxz1Mw_UXdDBvCRTnC1GbzXIONcrRioPkGuq70uBzi1wmP_tX7HK23Xjpt3X7sPh-jDYBRsrhAdoJWZ9O5PQWoMjNni6X5ARlZ3dI |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS-QwEA-HwqEPh3enuKfeRfBJCZuvZptHURfvQ7mHW9m30DSpu7DbLraCf76T7ceeooIvhZI0gZlk5pdO5jcIHTlPRSYcJczaiEjmPLE0gkfMhXMyHXAespGvrtXlSP4aR-OmzmnZ3nZvQ5J1TkNgacqr_sJl_VXiGwNXBsfgiGjwjwTO7OtgjVlY6CN-2oURVLQsrhqCcURK3oU1XxriqWNaoc1nAdKl3xluoU8NYMSntYY_ow8-_4I2_6MRhLerjnu1_Ipuzusi87gE8UM7nuYYmvHclxOcuGQRDByuXRmuFzpOZrfF3bSazDFgWGzDTz1bPOAC-s6bRM1tNBpe_Du7JE31BJIKqSsiYCdzK6yOvfJ6kOqA_FTiRaRBJRlIhmdS88THqQJFsYFPM-elFzpLaRZbsYPW8iL3uwh7NaCSMUttkkgV25g66QPVIFhSqWjcQ7QVnUkbavFQ4WJmVqTIQdoGpG2CtA3toePuk0XNq_FW5_1WH6bZYqXhAWwJxjRMf9g1w-YIEY8k98V9acBeBYox0HwPnbR6XA3x6oTf3tX7B_r493xo_vy8_r2HNgBRqfou2T5aq-7u_QGglsp-X67MRxEu4g4 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Dynamic+scaling+in+the+mesh+adaptive+direct+search+algorithm+for+blackbox+optimization&rft.jtitle=Optimization+and+engineering&rft.au=Audet%2C+Charles&rft.au=S%C3%A9bastien+Le+Digabel&rft.au=Tribes%2C+Christophe&rft.date=2016-06-01&rft.pub=Springer+Nature+B.V&rft.issn=1389-4420&rft.eissn=1573-2924&rft.volume=17&rft.issue=2&rft.spage=333&rft.epage=358&rft_id=info:doi/10.1007%2Fs11081-015-9283-0&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1389-4420&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1389-4420&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1389-4420&client=summon |