Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants

Details Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants

2011-03-10

arxiv.org/abs/1103.2056v1

SIAM J. Optimization, Vol. 16, No. 3 (2006) 910-937

Mathematics

Optimization and Control

Scientific paper

In the paper, the global optimization problem of a multidimensional "black-box" function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered. A new efficient algorithm for solving this problem is presented. At each iteration of the method a number of possible Lipschitz constants is chosen from a set of values varying from zero to infinity. This idea is unified with an efficient diagonal partition strategy. A novel technique balancing usage of local and global information during partitioning is proposed. A new procedure for finding lower bounds of the objective function over hyperintervals is also considered. It is demonstrated by extensive numerical experiments performed on more than 1600 multidimensional test functions that the new algorithm shows a very promising performance.

Affiliated with

Also associated with

No associations

Rating

Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631608