2012
DOI: 10.3846/20294913.2012.661170
|View full text |Cite
|
Sign up to set email alerts
|

Influence of Lipschitz Bounds on the Speed of Global Optimization

Abstract: Global optimization methods based on Lipschitz bounds have been analyzed and applied widely to solve various optimization problems. In this paper a bound for Lipschitz function is proposed, which is computed using function values at the vertices of a simplex and the radius of the circumscribed sphere. The efficiency of a branch and bound algorithm with proposed bound and combinations of bounds is evaluated experimentally while solving a number of multidimensional test problems for global optimization. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…Two of these global solvers (TOMLAB/GLCCLUSTER and MCS [23,31]) are based on the DIRECT (DIviding RECTangle) algorithm [24]. The DIRECT algorithm is a modification of standard Lipschitzian approaches [10,11,19,20,22,27,[34][35][36][38][39][40]43,44] eliminating the need to specify a Lipschitz constant. Due to its simplicity, DIRECT has been used to solve many engineering optimization problems [1][2][3]6,9,17,18,28].…”
mentioning
confidence: 99%
“…Two of these global solvers (TOMLAB/GLCCLUSTER and MCS [23,31]) are based on the DIRECT (DIviding RECTangle) algorithm [24]. The DIRECT algorithm is a modification of standard Lipschitzian approaches [10,11,19,20,22,27,[34][35][36][38][39][40]43,44] eliminating the need to specify a Lipschitz constant. Due to its simplicity, DIRECT has been used to solve many engineering optimization problems [1][2][3]6,9,17,18,28].…”
mentioning
confidence: 99%