Skip to main content

2020 | OriginalPaper | Buchkapitel

Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization

verfasst von : M. Fernanda P. Costa, Ana Maria A. C. Rocha, Edite M. G. P. Fernandes

Erschienen in: Numerical Computations: Theory and Algorithms

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

This paper addresses the problem of solving a constrained global optimization problem using a modification of the DIRECT method that incorporates the filter methodology to simultaneously minimize the objective function and the constraints violation. Thus, in the “Selection” step of the herein proposed DIRECT-filter algorithm, the hyperrectangles are classified in four categories and subsequently handled separately. The new algorithm also imposes upper bounds on the objective function and constraints violation aiming to discard some hyperrectangles from the process of identifying the potentially optimal ones. A heuristic to avoid the exploration of the hyperrectangles that have been mostly divided is also implemented. Preliminary numerical experiments are carried out to show the effectiveness of the imposed upper bounds on the objective and violation as well as the goodness of the heuristic.

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!

Literatur
1.
Zurück zum Zitat Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optim. 14(4), 980–1010 (2004)MathSciNetCrossRef Audet, C., Dennis Jr., J.E.: A pattern search filter method for nonlinear programming without derivatives. SIAM J. Optim. 14(4), 980–1010 (2004)MathSciNetCrossRef
2.
Zurück zum Zitat Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Technical report MCDO121206, University of São Paulo, SP, Brazil (2007) Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Technical report MCDO121206, University of São Paulo, SP, Brazil (2007)
3.
Zurück zum Zitat Costa, M.F.P., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Filter-based DIRECT method for constrained global optimization. J. Global Optim. 71(3), 517–536 (2018)MathSciNetCrossRef Costa, M.F.P., Rocha, A.M.A.C., Fernandes, E.M.G.P.: Filter-based DIRECT method for constrained global optimization. J. Global Optim. 71(3), 517–536 (2018)MathSciNetCrossRef
4.
Zurück zum Zitat DiPillo, G., Liuzzi, G., Lucidi, S., Piccialli, V., Rinaldi, F.: A DIRECT-type approach for derivative-free constrained global optimization. Comput. Optim. Appl. 65(2), 361–397 (2016)MathSciNetCrossRef DiPillo, G., Liuzzi, G., Lucidi, S., Piccialli, V., Rinaldi, F.: A DIRECT-type approach for derivative-free constrained global optimization. Comput. Optim. Appl. 65(2), 361–397 (2016)MathSciNetCrossRef
5.
Zurück zum Zitat DiPillo, G., Lucidi, S., Rinaldi, F.: A derivative-free algorithm for constrained global optimization based on exact penalty functions. J. Optim. Theory Appl. 164(3), 862–882 (2015)MathSciNetCrossRef DiPillo, G., Lucidi, S., Rinaldi, F.: A derivative-free algorithm for constrained global optimization based on exact penalty functions. J. Optim. Theory Appl. 164(3), 862–882 (2015)MathSciNetCrossRef
6.
Zurück zum Zitat Finkel, D.E., Kelley, C.T.: Convergence analysis of the DIRECT algorithm. Technical report TR04-28, North Carolina State University, NC, USA (2004) Finkel, D.E., Kelley, C.T.: Convergence analysis of the DIRECT algorithm. Technical report TR04-28, North Carolina State University, NC, USA (2004)
7.
Zurück zum Zitat Finkel, D.E., Kelley, C.T.: Additive scaling and the DIRECT algorithm. J. Global Optim. 36(4), 597–608 (2006)MathSciNetCrossRef Finkel, D.E., Kelley, C.T.: Additive scaling and the DIRECT algorithm. J. Global Optim. 36(4), 597–608 (2006)MathSciNetCrossRef
8.
Zurück zum Zitat Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. Ser. A 91(2), 239–269 (2002)MathSciNetCrossRef Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. Ser. A 91(2), 239–269 (2002)MathSciNetCrossRef
9.
Zurück zum Zitat Gablonsky, J.M.: DIRECT version 2.0 user guide. Technical report TR-01-08, North Carolina State University, NC, USA (2001) Gablonsky, J.M.: DIRECT version 2.0 user guide. Technical report TR-01-08, North Carolina State University, NC, USA (2001)
10.
Zurück zum Zitat Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the DIRECT algorithm. J. Global Optim. 21(1), 27–37 (2001)MathSciNetCrossRef Gablonsky, J.M., Kelley, C.T.: A locally-biased form of the DIRECT algorithm. J. Global Optim. 21(1), 27–37 (2001)MathSciNetCrossRef
12.
Zurück zum Zitat Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157–181 (1993)MathSciNetCrossRef Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157–181 (1993)MathSciNetCrossRef
13.
Zurück zum Zitat Liu, H., Xu, S., Chen, X., Wang, X., Ma, Q.: Constrained global optimization via a DIRECT-type constraint-handling technique and an adaptive metamodeling strategy. Struct. Multidiscip. Optim. 55(1), 155–177 (2017)MathSciNetCrossRef Liu, H., Xu, S., Chen, X., Wang, X., Ma, Q.: Constrained global optimization via a DIRECT-type constraint-handling technique and an adaptive metamodeling strategy. Struct. Multidiscip. Optim. 55(1), 155–177 (2017)MathSciNetCrossRef
14.
Zurück zum Zitat Liu, Q., Cheng, W.: A modified DIRECT algorithm with bilevel partition. J. Global Optim. 60(3), 483–499 (2014)MathSciNetCrossRef Liu, Q., Cheng, W.: A modified DIRECT algorithm with bilevel partition. J. Global Optim. 60(3), 483–499 (2014)MathSciNetCrossRef
15.
Zurück zum Zitat Liuzzi, G., Lucidi, S., Piccialli, V.: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization. Comput. Optim. Appl. 65(2), 449–475 (2016)MathSciNetCrossRef Liuzzi, G., Lucidi, S., Piccialli, V.: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization. Comput. Optim. Appl. 65(2), 449–475 (2016)MathSciNetCrossRef
16.
Zurück zum Zitat Paulavičius, R., Žilinskas, J.: Simplicial Lipschitz optimization without the Lipschitz constant. J. Global Optim. 59(1), 23–40 (2014)MathSciNetCrossRef Paulavičius, R., Žilinskas, J.: Simplicial Lipschitz optimization without the Lipschitz constant. J. Global Optim. 59(1), 23–40 (2014)MathSciNetCrossRef
17.
Zurück zum Zitat Paulavičius, R., Sergeyev, Y.D., Kvasov, D.E., Žilinskas, J.: Globally-biased DISIMPL algorithm for expensive global optimization. J. Global Optim. 59(2–3), 545–567 (2014)MathSciNetCrossRef Paulavičius, R., Sergeyev, Y.D., Kvasov, D.E., Žilinskas, J.: Globally-biased DISIMPL algorithm for expensive global optimization. J. Global Optim. 59(2–3), 545–567 (2014)MathSciNetCrossRef
18.
Zurück zum Zitat Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16(3), 910–937 (2006)MathSciNetCrossRef Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16(3), 910–937 (2006)MathSciNetCrossRef
20.
Zurück zum Zitat Stripinis, L., Paulavičius, R., Žilinskas, J.: Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim. Lett. 12(7), 1699–1712 (2018)MathSciNetCrossRef Stripinis, L., Paulavičius, R., Žilinskas, J.: Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT. Optim. Lett. 12(7), 1699–1712 (2018)MathSciNetCrossRef
21.
Zurück zum Zitat Stripinis, L., Paulavičius, R., Žilinskas, J.: Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization. Struct. Multidiscip. Optim. 59(6), 2155–2175 (2019)MathSciNetCrossRef Stripinis, L., Paulavičius, R., Žilinskas, J.: Penalty functions and two-step selection procedure based DIRECT-type algorithm for constrained global optimization. Struct. Multidiscip. Optim. 59(6), 2155–2175 (2019)MathSciNetCrossRef
22.
Zurück zum Zitat Wu, Y., Ozdamar, L., Kumar, A.: TRIOPT: a triangular-based partitioning algorithm for global optimization. J. Comput. Appl. Math. 177, 35–53 (2005)MathSciNetCrossRef Wu, Y., Ozdamar, L., Kumar, A.: TRIOPT: a triangular-based partitioning algorithm for global optimization. J. Comput. Appl. Math. 177, 35–53 (2005)MathSciNetCrossRef
Metadaten
Titel
Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
verfasst von
M. Fernanda P. Costa
Ana Maria A. C. Rocha
Edite M. G. P. Fernandes
Copyright-Jahr
2020
DOI
https://doi.org/10.1007/978-3-030-40616-5_5