Skip to main content

2017 | OriginalPaper | Buchkapitel

8. Mesh Adaptive Direct Search

verfasst von : Charles Audet, Warren Hare

Erschienen in: Derivative-Free and Blackbox Optimization

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Chapter 3 proposed the coordinate search (CS) algorithm for unconstrained optimization. The algorithm worked based on local exploration around the incumbent solution in the positive and negative orthogonal coordinate directions. In Chapter 7, this algorithm was expanded to allow a broader use of search directions, resulting in the generalised pattern search (GPS) algorithm. However, the convergence analysis of the GPS algorithm falls a little short of what we would like. First, the main result states that if the objective function f is locally Lipschitz, then the generalised directional derivatives are nonnegative for only a finite set of directions. Second, and more importantly, the analysis only examined unconstrained optimization problems. In practice, there are very few problems in which the variables are free to take any values.

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
An orthonormal basis is composed of orthogonal and unit vectors.
 
Literatur
3.
Zurück zum Zitat M.A. Abramson, C. Audet, Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17(2), 606–619 (2006)MathSciNetCrossRefMATH M.A. Abramson, C. Audet, Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17(2), 606–619 (2006)MathSciNetCrossRefMATH
6.
Zurück zum Zitat M.A. Abramson, C. Audet, J.E. Dennis Jr., S. Le Digabel, OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J. Optim. 20(2), 948–966 (2009)MathSciNetCrossRefMATH M.A. Abramson, C. Audet, J.E. Dennis Jr., S. Le Digabel, OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J. Optim. 20(2), 948–966 (2009)MathSciNetCrossRefMATH
8.
10.
Zurück zum Zitat C. Audet, A survey on direct search methods for blackbox optimization and their applications, in Mathematics Without Boundaries: Surveys in Interdisciplinary Research, ed. by P.M. Pardalos, T.M. Rassias, Chap. 2, pp. 31–56 (Springer, Berlin, 2014) C. Audet, A survey on direct search methods for blackbox optimization and their applications, in Mathematics Without Boundaries: Surveys in Interdisciplinary Research, ed. by P.M. Pardalos, T.M. Rassias, Chap. 2, pp. 31–56 (Springer, Berlin, 2014)
15.
Zurück zum Zitat C. Audet, J.E. Dennis Jr., Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188–217 (2006)MathSciNetCrossRefMATH C. Audet, J.E. Dennis Jr., Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188–217 (2006)MathSciNetCrossRefMATH
16.
Zurück zum Zitat C. Audet, J.E. Dennis Jr., Nonlinear programming by mesh adaptive direct searches. SIAG/Optim. Views-and-News 17(1), 2–11 (2006) C. Audet, J.E. Dennis Jr., Nonlinear programming by mesh adaptive direct searches. SIAG/Optim. Views-and-News 17(1), 2–11 (2006)
20.
Zurück zum Zitat C. Audet, S. Le Digabel, C. Tribes, NOMAD user guide. Technical Report G-2009-37, Les cahiers du GERAD (2009) C. Audet, S. Le Digabel, C. Tribes, NOMAD user guide. Technical Report G-2009-37, Les cahiers du GERAD (2009)
36.
Zurück zum Zitat G.E.P. Box, Evolutionary operation: a method for increasing industrial productivity. Appl. Stat. 6(2), 81–101 (1957)CrossRef G.E.P. Box, Evolutionary operation: a method for increasing industrial productivity. Appl. Stat. 6(2), 81–101 (1957)CrossRef
40.
Zurück zum Zitat T.D. Choi, O.J. Eslinger, C.T. Kelley, J.W. David, M. Etheridge, Optimization of automotive valve train components with implicit filtering. Optim. Eng. 1(1), 9–27 (2000)CrossRefMATH T.D. Choi, O.J. Eslinger, C.T. Kelley, J.W. David, M. Etheridge, Optimization of automotive valve train components with implicit filtering. Optim. Eng. 1(1), 9–27 (2000)CrossRefMATH
41.
Zurück zum Zitat F.H. Clarke, 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 F.H. Clarke, 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
48.
58.
64.
68.
Zurück zum Zitat E. Fermi, N. Metropolis, Numerical solution of a minimum problem. Los Alamos Unclassified Report LA–1492, Los Alamos National Laboratory, Los Alamos (1952) E. Fermi, N. Metropolis, Numerical solution of a minimum problem. Los Alamos Unclassified Report LA–1492, Los Alamos National Laboratory, Los Alamos (1952)
69.
Zurück zum Zitat D.E. Finkel, C.T. Kelley, Convergence analysis of the DIRECT algorithm. Technical Report CRSC-TR04-28, Center for Research in Scientific Computation (2004) D.E. Finkel, C.T. Kelley, Convergence analysis of the DIRECT algorithm. Technical Report CRSC-TR04-28, Center for Research in Scientific Computation (2004)
71.
Zurück zum Zitat D.E. Finkel, C.T. Kelley, Convergence analysis of sampling methods for perturbed Lipschitz functions. Pac. J. Optim. 5(2), 339–350 (2009)MathSciNetMATH D.E. Finkel, C.T. Kelley, Convergence analysis of sampling methods for perturbed Lipschitz functions. Pac. J. Optim. 5(2), 339–350 (2009)MathSciNetMATH
77.
Zurück zum Zitat K.R. Fowler, C.T. Kelley, C.T. Miller, C.E. Kees, R.W. Darwin, J.P. Reese, M.W. Farthing, M.S.C. Reed, Solution of a well-field design problem with implicit filtering. Optim. Eng. 5(2), 207–234 (2004)MathSciNetCrossRefMATH K.R. Fowler, C.T. Kelley, C.T. Miller, C.E. Kees, R.W. Darwin, J.P. Reese, M.W. Farthing, M.S.C. Reed, Solution of a well-field design problem with implicit filtering. Optim. Eng. 5(2), 207–234 (2004)MathSciNetCrossRefMATH
80.
Zurück zum Zitat U.M. García-Palomares, J.F. Rodríguez, New sequential and parallel derivative-free algorithms for unconstrained optimization. SIAM J. Optim. 13(1), 79–96 (2002)MathSciNetCrossRefMATH U.M. García-Palomares, J.F. Rodríguez, New sequential and parallel derivative-free algorithms for unconstrained optimization. SIAM J. Optim. 13(1), 79–96 (2002)MathSciNetCrossRefMATH
85.
Zurück zum Zitat P. Gilmore, C.T. Kelly, C.T. Miller, G.A. Williams, Implicit filtering and optimal design problems, in Optimal Design and Control, ed. by J. Borggaard, J. Burkhardt, M. Gunzberger, J. Peterson. Progress in Systems and Control Theory, vol. 19 (Birkhäuser, Cambridge, 1995), pp. 159–176 P. Gilmore, C.T. Kelly, C.T. Miller, G.A. Williams, Implicit filtering and optimal design problems, in Optimal Design and Control, ed. by J. Borggaard, J. Burkhardt, M. Gunzberger, J. Peterson. Progress in Systems and Control Theory, vol. 19 (Birkhäuser, Cambridge, 1995), pp. 159–176
94.
97.
Zurück zum Zitat J.-B. Hiriart-Urruty, C. Lemaréchal, Convex Analysis and Minimization Algorithms (Springer, Berlin, 1993)MATH J.-B. Hiriart-Urruty, C. Lemaréchal, Convex Analysis and Minimization Algorithms (Springer, Berlin, 1993)MATH
99.
Zurück zum Zitat R. Hooke, T.A. Jeeves, “Direct search” solution of numerical and statistical problems. J. Assoc. Comput. Mach. 8(2), 212–229 (1961)CrossRefMATH R. Hooke, T.A. Jeeves, “Direct search” solution of numerical and statistical problems. J. Assoc. Comput. Mach. 8(2), 212–229 (1961)CrossRefMATH
102.
Zurück zum Zitat J. Jahn, Introduction to the Theory of Nonlinear Optimization (Springer, Berlin, 1994)CrossRefMATH J. Jahn, Introduction to the Theory of Nonlinear Optimization (Springer, Berlin, 1994)CrossRefMATH
105.
Zurück zum Zitat C.T. Kelley, Implicit Filtering (Society for Industrial and Applied Mathematics, Philadelphia, 2011)CrossRefMATH C.T. Kelley, Implicit Filtering (Society for Industrial and Applied Mathematics, Philadelphia, 2011)CrossRefMATH
109.
Zurück zum Zitat T.G. Kolda, R.M. Lewis, V. Torczon, Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385–482 (2003)MathSciNetCrossRefMATH T.G. Kolda, R.M. Lewis, V. Torczon, Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385–482 (2003)MathSciNetCrossRefMATH
110.
Zurück zum Zitat T.G. Kolda, R.M. Lewis, V. Torczon, Stationarity results for generating set search for linearly constrained optimization. SIAM J. Optim. 17(4), 943–968 (2006)MathSciNetCrossRefMATH T.G. Kolda, R.M. Lewis, V. Torczon, Stationarity results for generating set search for linearly constrained optimization. SIAM J. Optim. 17(4), 943–968 (2006)MathSciNetCrossRefMATH
112.
Zurück zum Zitat S. Le Digabel, Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1–44:15 (2011) S. Le Digabel, Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1–44:15 (2011)
114.
Zurück zum Zitat E.B. Leach, A note on inverse function theorem, in Proceedings of the American Mathematical Society, vol. 12, pp. 694–697 (1961) E.B. Leach, A note on inverse function theorem, in Proceedings of the American Mathematical Society, vol. 12, pp. 694–697 (1961)
115.
Zurück zum Zitat R.M. Lewis, V. Torczon, Rank ordering and positive bases in pattern search algorithms. Technical Report 96–71, Institute for Computer Applications in Science and Engineering, Mail Stop 132C, NASA Langley Research Center, Hampton, Virginia 23681–2199 (1996) R.M. Lewis, V. Torczon, Rank ordering and positive bases in pattern search algorithms. Technical Report 96–71, Institute for Computer Applications in Science and Engineering, Mail Stop 132C, NASA Langley Research Center, Hampton, Virginia 23681–2199 (1996)
116.
Zurück zum Zitat R.M. Lewis, V. Torczon, Rank ordering and positive bases in pattern search algorithms. Technical Report TR96-71, ICASE, NASA Langley Research Center (1999) R.M. Lewis, V. Torczon, Rank ordering and positive bases in pattern search algorithms. Technical Report TR96-71, ICASE, NASA Langley Research Center (1999)
117.
Zurück zum Zitat R.M. Lewis, V. Torczon, M.W. Trosset, Why pattern search works. Optima 59, 1–7 (1998). Also available as ICASE Technical Report 98–57. ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, Virginia 23681–2199 R.M. Lewis, V. Torczon, M.W. Trosset, Why pattern search works. Optima 59, 1–7 (1998). Also available as ICASE Technical Report 98–57. ICASE, Mail Stop 132C, NASA Langley Research Center, Hampton, Virginia 23681–2199
118.
Zurück zum Zitat R.M. Lewis, V. Torczon, M.W. Trosset, Direct search methods: then and now. J. Comput. Appl. Math. 124(1–2), 191–207 (2000)MathSciNetCrossRefMATH R.M. Lewis, V. Torczon, M.W. Trosset, Direct search methods: then and now. J. Comput. Appl. Math. 124(1–2), 191–207 (2000)MathSciNetCrossRefMATH
122.
Zurück zum Zitat S. Lucidi, M. Sciandrone, On the global convergence of derivative-free methods for unconstrained optimization. SIAM J. Optim. 13(1), 97–116 (2002)MathSciNetCrossRefMATH S. Lucidi, M. Sciandrone, On the global convergence of derivative-free methods for unconstrained optimization. SIAM J. Optim. 13(1), 97–116 (2002)MathSciNetCrossRefMATH
142.
Zurück zum Zitat C.J. Price, I.D. Coope, Frames and grids in unconstrained and linearly constrained optimization: a nonsmooth approach. SIAM J. Optim. 14, 415–438 (2003)MathSciNetCrossRefMATH C.J. Price, I.D. Coope, Frames and grids in unconstrained and linearly constrained optimization: a nonsmooth approach. SIAM J. Optim. 14, 415–438 (2003)MathSciNetCrossRefMATH
148.
151.
Zurück zum Zitat R.T. Rockafellar, Generalized directional derivatives and subgradients of nonconvex functions. Can. J. Math. 32(2), 257–280 (1980)MathSciNetCrossRefMATH R.T. Rockafellar, Generalized directional derivatives and subgradients of nonconvex functions. Can. J. Math. 32(2), 257–280 (1980)MathSciNetCrossRefMATH
153.
Zurück zum Zitat S.E. Selvan, P.B. Borckmans, A. Chattopadhyay, P.-A. Absil, Spherical mesh adaptive direct search for separating quasi-uncorrelated sources by range-based independent component analysis. Neural Comput. 25(9), 2486–2522 (2013)MathSciNetCrossRef S.E. Selvan, P.B. Borckmans, A. Chattopadhyay, P.-A. Absil, Spherical mesh adaptive direct search for separating quasi-uncorrelated sources by range-based independent component analysis. Neural Comput. 25(9), 2486–2522 (2013)MathSciNetCrossRef
160.
Zurück zum Zitat V. Torczon, M.W. Trosset, From evolutionary operation to parallel direct search: pattern search algorithms for numerical optimization. Comput. Sci. Stat. 29, 396–401 (1998) V. Torczon, M.W. Trosset, From evolutionary operation to parallel direct search: pattern search algorithms for numerical optimization. Comput. Sci. Stat. 29, 396–401 (1998)
161.
Zurück zum Zitat M.W. Trosset, I know it when I see it: toward a definition of direct search methods. SIAG/OPT Views-and-News: Forum SIAM Activity Group Optim. 9, 7–10 (1997) M.W. Trosset, I know it when I see it: toward a definition of direct search methods. SIAG/OPT Views-and-News: Forum SIAM Activity Group Optim. 9, 7–10 (1997)
163.
Zurück zum Zitat B. Van Dyke, T.J. Asaki, Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions. J. Optim. Theory Appl. 159(3), 805–821 (2013)MathSciNetCrossRefMATH B. Van Dyke, T.J. Asaki, Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions. J. Optim. Theory Appl. 159(3), 805–821 (2013)MathSciNetCrossRefMATH
165.
Zurück zum Zitat L.N. Vicente, A.L. Custódio, Analysis of direct searches for discontinuous functions. Math. Program. 133(1–2), 299–325 (2012)MathSciNetCrossRefMATH L.N. Vicente, A.L. Custódio, Analysis of direct searches for discontinuous functions. Math. Program. 133(1–2), 299–325 (2012)MathSciNetCrossRefMATH
170.
Zurück zum Zitat T.A. Winslow, R.J. Trew, P. Gilmore, C.T. Kelley, Doping profiles for optimum class B performance of GaAs MESFET amplifiers, in Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits, pp. 188–197 (1991) T.A. Winslow, R.J. Trew, P. Gilmore, C.T. Kelley, Doping profiles for optimum class B performance of GaAs MESFET amplifiers, in Proceedings IEEE/Cornell Conference on Advanced Concepts in High Speed Devices and Circuits, pp. 188–197 (1991)
173.
Zurück zum Zitat W.-C. Yu, Positive basis and a class of direct search techniques. Sci. Sinica, Special Issue of Mathematics 1, 53–67 (1979) W.-C. Yu, Positive basis and a class of direct search techniques. Sci. Sinica, Special Issue of Mathematics 1, 53–67 (1979)
Metadaten
Titel
Mesh Adaptive Direct Search
verfasst von
Charles Audet
Warren Hare
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68913-5_8

Premium Partner