Skip to main content
Top

2014 | OriginalPaper | Chapter

2. Lipschitz Optimization with Different Bounds over Simplices

Authors : Remigijus Paulavičius, Julius Žilinskas

Published in: Simplicial Global Optimization

Publisher: Springer New York

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Many problems in engineering, physics, economics, and other fields may be formulated as optimization problems, where the optimal value of an objective function must be found [23, 55, 59, 110, 114, 134, 136].

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Literature
2.
go back to reference Baravykaitė, M., Čiegis, R., Žilinskas, J.: Template realization of generalized branch and bound algorithm. Math. Model. Anal. 10(3), 217–236 (2005)MathSciNetMATH Baravykaitė, M., Čiegis, R., Žilinskas, J.: Template realization of generalized branch and bound algorithm. Math. Model. Anal. 10(3), 217–236 (2005)MathSciNetMATH
3.
13.
go back to reference Chandra, R., Menon, R., Dagum, L., Kohr, D., Maydan, D., McDonald, J.: Parallel Programming in OpenMP. Morgan Kaufmann, Los Altos (2000) Chandra, R., Menon, R., Dagum, L., Kohr, D., Maydan, D., McDonald, J.: Parallel Programming in OpenMP. Morgan Kaufmann, Los Altos (2000)
14.
go back to reference Chapman, B., Jost, G., Van Der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming, vol. 10. MIT, Cambridge (2008) Chapman, B., Jost, G., Van Der Pas, R.: Using OpenMP: Portable Shared Memory Parallel Programming, vol. 10. MIT, Cambridge (2008)
16.
go back to reference Čiegis, R., Henty, D., Kågström, B., Žilinskas, J. (eds.): Parallel Scientific Computing and Optimization. Springer Optimization and Its Applications, vol. 27. Springer, New York (2009) Čiegis, R., Henty, D., Kågström, B., Žilinskas, J. (eds.): Parallel Scientific Computing and Optimization. Springer Optimization and Its Applications, vol. 27. Springer, New York (2009)
19.
go back to reference D’Apuzzo, M., Marino, M., Migdalas, A., Pardalos, P.M., Toraldo, G.: Parallel computing in global optimization. In: Kontoghiorghes, E.J. (ed.) Handbook of Parallel Computing and Statistics, pp. 225–258. Chapman & Hall, London (2006) D’Apuzzo, M., Marino, M., Migdalas, A., Pardalos, P.M., Toraldo, G.: Parallel computing in global optimization. In: Kontoghiorghes, E.J. (ed.) Handbook of Parallel Computing and Statistics, pp. 225–258. Chapman & Hall, London (2006)
27.
28.
go back to reference Ferreira, A., Pardalos, P.M. (eds.): Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques. Lecture Notes in Computer Science, vol. 1054. Springer, New York (1996) Ferreira, A., Pardalos, P.M. (eds.): Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques. Lecture Notes in Computer Science, vol. 1054. Springer, New York (1996)
34.
go back to reference Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization, vol. 1–6. Kluwer, Dordrecht (2001)CrossRefMATH Floudas, C.A., Pardalos, P.M.: Encyclopedia of Optimization, vol. 1–6. Kluwer, Dordrecht (2001)CrossRefMATH
38.
go back to reference Galperin, E.A.: Precision, complexity, and computational schemes of the cubic algorithm. J. Optim. Theor. Appl. 57, 223–238 (1988)MathSciNetCrossRefMATH Galperin, E.A.: Precision, complexity, and computational schemes of the cubic algorithm. J. Optim. Theor. Appl. 57, 223–238 (1988)MathSciNetCrossRefMATH
40.
41.
go back to reference Gergel, V.P.: A global optimization algorithm for multivariate function with Lipschitzian first derivatives. J. Global Optim. 10(3), 257–281 (1997)MathSciNetCrossRefMATH Gergel, V.P.: A global optimization algorithm for multivariate function with Lipschitzian first derivatives. J. Global Optim. 10(3), 257–281 (1997)MathSciNetCrossRefMATH
44.
go back to reference Gorodetsky, S.: Paraboloid triangulation methods in solving multiextremal optimization problems with constraints for a class of functions with Lipschitz directional derivatives. Vestnik of Lobachevsky State University of Nizhni Novgorod 1, 144–155 (2012) Gorodetsky, S.: Paraboloid triangulation methods in solving multiextremal optimization problems with constraints for a class of functions with Lipschitz directional derivatives. Vestnik of Lobachevsky State University of Nizhni Novgorod 1, 144–155 (2012)
45.
go back to reference Gourdin, E., Hansen, P., Jaumard, B.: Global optimization of multivariate Lipschitz functions: Survey and computational comparison. Les Cahiers du GERAD (1994) Gourdin, E., Hansen, P., Jaumard, B.: Global optimization of multivariate Lipschitz functions: Survey and computational comparison. Les Cahiers du GERAD (1994)
47.
go back to reference Gropp, W., Lusk, E.L., Skjellum, A.: Using MPI-: Portable Parallel Programming with the Message Passing Interface, vol. 1. MIT, Cambridge (1999) Gropp, W., Lusk, E.L., Skjellum, A.: Using MPI-: Portable Parallel Programming with the Message Passing Interface, vol. 1. MIT, Cambridge (1999)
49.
go back to reference Hansen, P., Jaumard, B.: Lipshitz optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, vol. 1, pp. 407–493. Kluwer, Dordrecht (1995)CrossRef Hansen, P., Jaumard, B.: Lipshitz optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, vol. 1, pp. 407–493. Kluwer, Dordrecht (1995)CrossRef
53.
go back to reference Horst, R.: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization. J. Optim. Theor. Appl. 51, 271–291 (1986)MathSciNetCrossRefMATH Horst, R.: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization. J. Optim. Theor. Appl. 51, 271–291 (1986)MathSciNetCrossRefMATH
55.
go back to reference Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Nonconvex Optimization and Its Application. Kluwer, Dordrecht (1995)MATH Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Nonconvex Optimization and Its Application. Kluwer, Dordrecht (1995)MATH
58.
go back to reference Horst, R., Tuy, H.: On the convergence of global methods in multiextremal optimization. J. Optim. Theor. Appl. 54, 253–271 (1987)MathSciNetCrossRefMATH Horst, R., Tuy, H.: On the convergence of global methods in multiextremal optimization. J. Optim. Theor. Appl. 54, 253–271 (1987)MathSciNetCrossRefMATH
59.
60.
go back to reference Jansson, C., Knuppel, O.: A global minimization method: The multi-dimensional case. Tech. rep., TU Hamburg-Harburg (1992) Jansson, C., Knuppel, O.: A global minimization method: The multi-dimensional case. Tech. rep., TU Hamburg-Harburg (1992)
61.
go back to reference Jaumard, B., Ribault, H., Herrmann, T.: An on-line cone intersection algorithm for global optimization of multivariate Lipschitz functions. Cahiers du GERAD 95(7) (1995) Jaumard, B., Ribault, H., Herrmann, T.: An on-line cone intersection algorithm for global optimization of multivariate Lipschitz functions. Cahiers du GERAD 95(7) (1995)
64.
go back to reference Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theor. Appl. 79(1), 157–181 (1993). doi:10.1007/BF00941892MathSciNetCrossRefMATH Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theor. Appl. 79(1), 157–181 (1993). doi:10.1007/BF00941892MathSciNetCrossRefMATH
67.
go back to reference Kolmogorov, A., Fomin, S.: Elements of Function Theory and Functional Analysis. Nauka, Moscow (1968) Kolmogorov, A., Fomin, S.: Elements of Function Theory and Functional Analysis. Nauka, Moscow (1968)
70.
go back to reference Kvasov, D.E., Pizzuti, C., Sergeyev, Y.D.: Local tuning and partition strategies for diagonal go methods. Numerische Mathematik 94(1), 93–106 (2003)MathSciNetCrossRefMATH Kvasov, D.E., Pizzuti, C., Sergeyev, Y.D.: Local tuning and partition strategies for diagonal go methods. Numerische Mathematik 94(1), 93–106 (2003)MathSciNetCrossRefMATH
71.
go back to reference Kvasov, D.E., Sergeyev, Y.D.: Multidimensional global optimization algorithm based on adaptive diagonal curves. Comput. Math. Math. Phys. 43(1), 40–56 (2003)MathSciNet Kvasov, D.E., Sergeyev, Y.D.: Multidimensional global optimization algorithm based on adaptive diagonal curves. Comput. Math. Math. Phys. 43(1), 40–56 (2003)MathSciNet
72.
go back to reference Kvasov, D.E., Sergeyev, Y.D.: A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3, 303–318 (2009). doi:10.1007/s11590-008-0110-9MathSciNetCrossRefMATH Kvasov, D.E., Sergeyev, Y.D.: A univariate global search working with a set of Lipschitz constants for the first derivative. Optim. Lett. 3, 303–318 (2009). doi:10.1007/s11590-008-0110-9MathSciNetCrossRefMATH
73.
go back to reference Kvasov, D.E., Sergeyev, Y.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236(16), 4042–4054 (2012)MathSciNetCrossRefMATH Kvasov, D.E., Sergeyev, Y.D.: Lipschitz gradients for global optimization in a one-point-based partitioning scheme. J. Comput. Appl. Math. 236(16), 4042–4054 (2012)MathSciNetCrossRefMATH
79.
go back to reference Lera, D., Sergeyev, Y.D.: Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives. SIAM J. Optim. 23(1), 508–529 (2013)MathSciNetCrossRefMATH Lera, D., Sergeyev, Y.D.: Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives. SIAM J. Optim. 23(1), 508–529 (2013)MathSciNetCrossRefMATH
82.
go back to reference Madsen, K., Žilinskas, J.: Testing branch-and-bound methods for global optimization. Tech. Rep. IMM-REP-2000-05, Technical University of Denmark (2000) Madsen, K., Žilinskas, J.: Testing branch-and-bound methods for global optimization. Tech. Rep. IMM-REP-2000-05, Technical University of Denmark (2000)
84.
go back to reference Mayne, D.Q., Polak, E.: Outer approximation algorithm for nondifferentiable optimization problems. J. Optim. Theor. Appl. 42(1), 19–30 (1984)MathSciNetCrossRefMATH Mayne, D.Q., Polak, E.: Outer approximation algorithm for nondifferentiable optimization problems. J. Optim. Theor. Appl. 42(1), 19–30 (1984)MathSciNetCrossRefMATH
86.
go back to reference Meewella, C.C., Mayne, D.Q.: An algorithm for global optimization of Lipschitz continuous functions. J. Optim. Theor. Appl. 57(2), 307–323 (1988)MathSciNetCrossRefMATH Meewella, C.C., Mayne, D.Q.: An algorithm for global optimization of Lipschitz continuous functions. J. Optim. Theor. Appl. 57(2), 307–323 (1988)MathSciNetCrossRefMATH
87.
go back to reference Meewella, C.C., Mayne, D.Q.: An efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions. J. Optim. Theor. Appl. 61(2), 247–270 (1989)MathSciNetCrossRefMATH Meewella, C.C., Mayne, D.Q.: An efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions. J. Optim. Theor. Appl. 61(2), 247–270 (1989)MathSciNetCrossRefMATH
88.
go back to reference Migdalas, A., Pardalos, P.M., Storøy, S.: Parallel Computing in Optimization. Applied Optimization, vol. 7. Kluwer, Dordrecht (1997) Migdalas, A., Pardalos, P.M., Storøy, S.: Parallel Computing in Optimization. Applied Optimization, vol. 7. Kluwer, Dordrecht (1997)
89.
go back to reference Mladineo, R.H.: An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34(2), 188–200 (1986)MathSciNetCrossRefMATH Mladineo, R.H.: An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34(2), 188–200 (1986)MathSciNetCrossRefMATH
94.
go back to reference Pardalos, P.M. (ed.): Parallel Processing of Discrete Problems. IMA Volumes in Mathematics and its Applications, vol. 106. Springer, New York (1999) Pardalos, P.M. (ed.): Parallel Processing of Discrete Problems. IMA Volumes in Mathematics and its Applications, vol. 106. Springer, New York (1999)
96.
go back to reference Paulavičius, R., Žilinskas, J.: Analysis of different norms and corresponding Lipschitz constants for global optimization. Tech. Econ. Dev. Econ. 12(4), 301–306 (2006) Paulavičius, R., Žilinskas, J.: Analysis of different norms and corresponding Lipschitz constants for global optimization. Tech. Econ. Dev. Econ. 12(4), 301–306 (2006)
97.
go back to reference Paulavičius, R., Žilinskas, J.: Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case. Inform. Tech. Contr. 36(4), 383–387 (2007) Paulavičius, R., Žilinskas, J.: Analysis of different norms and corresponding Lipschitz constants for global optimization in multidimensional case. Inform. Tech. Contr. 36(4), 383–387 (2007)
98.
go back to reference Paulavičius, R., Žilinskas, J.: Improved Lipschitz bounds with the first norm for function values over multidimensional simplex. Math. Model. Anal. 13(4), 553–563 (2008)MathSciNetCrossRefMATH Paulavičius, R., Žilinskas, J.: Improved Lipschitz bounds with the first norm for function values over multidimensional simplex. Math. Model. Anal. 13(4), 553–563 (2008)MathSciNetCrossRefMATH
99.
go back to reference Paulavičius, R., Žilinskas, J.: Global optimization using the branch-and-bound algorithm with a combination of Lipschitz bounds over simplices. Tech. Econ. Dev. Econ. 15(2), 310–325 (2009)CrossRef Paulavičius, R., Žilinskas, J.: Global optimization using the branch-and-bound algorithm with a combination of Lipschitz bounds over simplices. Tech. Econ. Dev. Econ. 15(2), 310–325 (2009)CrossRef
100.
go back to reference Paulavičius, R., Žilinskas, J.: Influence of Lipschitz bounds on the speed of global optimization. Tech. Econ. Dev. Econ. 18(1), 54–66 (2012). doi:10.3846/20294913.2012.661170CrossRef Paulavičius, R., Žilinskas, J.: Influence of Lipschitz bounds on the speed of global optimization. Tech. Econ. Dev. Econ. 18(1), 54–66 (2012). doi:10.3846/20294913.2012.661170CrossRef
102.
go back to reference Paulavičius, R., Žilinskas, J., Grothey, A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173–183 (2010). doi:10.1007/s11590-009-0156-3MathSciNetCrossRefMATH Paulavičius, R., Žilinskas, J., Grothey, A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173–183 (2010). doi:10.1007/s11590-009-0156-3MathSciNetCrossRefMATH
103.
go back to reference Paulavičius, R., Žilinskas, J., Grothey, A.: Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Meth. Software 26(3), 487–498 (2011)CrossRef Paulavičius, R., Žilinskas, J., Grothey, A.: Parallel branch and bound for global optimization with combination of Lipschitz bounds. Optim. Meth. Software 26(3), 487–498 (2011)CrossRef
104.
go back to reference Pedoe, D.: Circles: A Mathematical View. Math. Assoc. Amer., Washington, DC (1995)MATH Pedoe, D.: Circles: A Mathematical View. Math. Assoc. Amer., Washington, DC (1995)MATH
107.
108.
go back to reference Pinter, J.: Branch-and-bound algorithms for solving global optimization problems with Lipschitzian structure. Optimization 19(1), 101–110 (1988)MathSciNetCrossRefMATH Pinter, J.: Branch-and-bound algorithms for solving global optimization problems with Lipschitzian structure. Optimization 19(1), 101–110 (1988)MathSciNetCrossRefMATH
109.
go back to reference Pinter, J.: Continuous global optimization software: A brief review. Optika 52, 1–8 (1996) Pinter, J.: Continuous global optimization software: A brief review. Optika 52, 1–8 (1996)
110.
go back to reference Pintér, J.D.: Global Optimization in Action: Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications. Nonconvex Optimization and Its Application. Springer, New York (1996)CrossRefMATH Pintér, J.D.: Global Optimization in Action: Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications. Nonconvex Optimization and Its Application. Springer, New York (1996)CrossRefMATH
111.
go back to reference Piyavskii, S.A.: An algorithm for finding the absolute minimum of a function. Theor. Optim. Solut. 2, 13–24 (1967). In Russian Piyavskii, S.A.: An algorithm for finding the absolute minimum of a function. Theor. Optim. Solut. 2, 13–24 (1967). In Russian
112.
go back to reference Piyavskii, S.A.: An algorithm for finding the absolute extremum of a function. Zh. Vychisl. Mat. mat. Fiz 12(4), 888–896 (1972) Piyavskii, S.A.: An algorithm for finding the absolute extremum of a function. Zh. Vychisl. Mat. mat. Fiz 12(4), 888–896 (1972)
116.
117.
go back to reference Sergeyev, Y.D.: A one-dimensional deterministic global minimization algorithm. Comput. Math. Math. Phys. 35(5), 553–562 (1995)MathSciNet Sergeyev, Y.D.: A one-dimensional deterministic global minimization algorithm. Comput. Math. Math. Phys. 35(5), 553–562 (1995)MathSciNet
118.
go back to reference Sergeyev, Y.D.: A method using local tuning for minimizing functions with Lipschitz derivatives. In: Developments in Global Optimization, pp. 199–216. Springer, New York (1997) Sergeyev, Y.D.: A method using local tuning for minimizing functions with Lipschitz derivatives. In: Developments in Global Optimization, pp. 199–216. Springer, New York (1997)
119.
120.
go back to reference Sergeyev, Y.D.: Multidimensional global optimization using the first derivatives. Comput. Math. Math. Phys. 39(5), 711–720 (1999)MathSciNetMATH Sergeyev, Y.D.: Multidimensional global optimization using the first derivatives. Comput. Math. Math. Phys. 39(5), 711–720 (1999)MathSciNetMATH
121.
go back to reference Sergeyev, Y.D.: Univariate global optimization with multiextremal non-differentiable constraints without penalty functions. Comput. Optim. Appl. 34(2), 229–248 (2006)MathSciNetCrossRefMATH Sergeyev, Y.D.: Univariate global optimization with multiextremal non-differentiable constraints without penalty functions. Comput. Optim. Appl. 34(2), 229–248 (2006)MathSciNetCrossRefMATH
122.
go back to reference Sergeyev, Y.D., Grishagin, V.: A parallel method for finding the global minimum of univariate functions. J. Optim. Theor. Appl. 80(3), 513–536 (1994)MathSciNetCrossRefMATH Sergeyev, Y.D., Grishagin, V.: A parallel method for finding the global minimum of univariate functions. J. Optim. Theor. Appl. 80(3), 513–536 (1994)MathSciNetCrossRefMATH
123.
go back to reference Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16, 910–937 (2006). doi:10.1137/040621132MathSciNetCrossRefMATH Sergeyev, Y.D., Kvasov, D.E.: Global search based on efficient diagonal partitions and a set of Lipschitz constants. SIAM J. Optim. 16, 910–937 (2006). doi:10.1137/040621132MathSciNetCrossRefMATH
124.
go back to reference Sergeyev, Y.D., Kvasov, D.E.: Diagonal Global Optimization Methods. FizMatLit, Moscow (2008). In Russian Sergeyev, Y.D., Kvasov, D.E.: Diagonal Global Optimization Methods. FizMatLit, Moscow (2008). In Russian
125.
go back to reference Sergeyev, Y.D., Kvasov, D.E.: Lipschitz global optimization and estimates of the Lipschitz constant. In: Chaoqun, M., Lean, Y., Dabin, Z., Zhongbao, Z. (eds.) Global Optimization: Theory, Methods and Applications, I, pp. 518–521. Global Link, Hong Kong (2009) Sergeyev, Y.D., Kvasov, D.E.: Lipschitz global optimization and estimates of the Lipschitz constant. In: Chaoqun, M., Lean, Y., Dabin, Z., Zhongbao, Z. (eds.) Global Optimization: Theory, Methods and Applications, I, pp. 518–521. Global Link, Hong Kong (2009)
127.
go back to reference Sergeyev, Y.D., Kvasov, D.E., Khalaf, F.M.: A one-dimensional local tuning algorithm for solving go problems with partially defined constraints. Optim. Lett. 1(1), 85–99 (2007)MathSciNetCrossRefMATH Sergeyev, Y.D., Kvasov, D.E., Khalaf, F.M.: A one-dimensional local tuning algorithm for solving go problems with partially defined constraints. Optim. Lett. 1(1), 85–99 (2007)MathSciNetCrossRefMATH
128.
go back to reference Sergeyev, Y.D., Pugliese, P., Famularo, D.: Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints. Math. Program. 96(3), 489–512 (2003)MathSciNetCrossRefMATH Sergeyev, Y.D., Pugliese, P., Famularo, D.: Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints. Math. Program. 96(3), 489–512 (2003)MathSciNetCrossRefMATH
129.
go back to reference Sergeyev, Y.D., Strongin, R.G., Lera, D.: Introduction to global optimization exploiting space-filling curves. Springer, New York (2013)CrossRefMATH Sergeyev, Y.D., Strongin, R.G., Lera, D.: Introduction to global optimization exploiting space-filling curves. Springer, New York (2013)CrossRefMATH
130.
131.
go back to reference Snir, M.: MPI the Complete Reference: The MPI Core, vol. 1. MIT, Cambridge (1998) Snir, M.: MPI the Complete Reference: The MPI Core, vol. 1. MIT, Cambridge (1998)
132.
go back to reference Strongin, R.G.: Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves. J. Global Optim. 2, 357–378 (1992)MathSciNetCrossRefMATH Strongin, R.G.: Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves. J. Global Optim. 2, 357–378 (1992)MathSciNetCrossRefMATH
133.
go back to reference Strongin, R.G., Sergeyev, Y.D.: Global multidimensional optimization on parallel computer. Parallel Comput. 18(11), 1259–1273 (1992)MathSciNetCrossRefMATH Strongin, R.G., Sergeyev, Y.D.: Global multidimensional optimization on parallel computer. Parallel Comput. 18(11), 1259–1273 (1992)MathSciNetCrossRefMATH
134.
go back to reference Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. KAP, Dordrecht (2000)CrossRef Strongin, R.G., Sergeyev, Y.D.: Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. KAP, Dordrecht (2000)CrossRef
141.
go back to reference Wood, G.R.: Multidimensional bisection applied to global optimisation. Comp. Math. Appl. 21(6–7), 161–172 (1991)CrossRefMATH Wood, G.R.: Multidimensional bisection applied to global optimisation. Comp. Math. Appl. 21(6–7), 161–172 (1991)CrossRefMATH
142.
144.
go back to reference Zhang, B.P., Wood, G., Baritompa, W.: Multidimensional bisection: The performance and the context. J. Global Optim. 3(3), 337–358 (1993)MathSciNetCrossRefMATH Zhang, B.P., Wood, G., Baritompa, W.: Multidimensional bisection: The performance and the context. J. Global Optim. 3(3), 337–358 (1993)MathSciNetCrossRefMATH
Metadata
Title
Lipschitz Optimization with Different Bounds over Simplices
Authors
Remigijus Paulavičius
Julius Žilinskas
Copyright Year
2014
Publisher
Springer New York
DOI
https://doi.org/10.1007/978-1-4614-9093-7_2