Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms

Details Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms

2011-03-14

arxiv.org/abs/1103.2657v1

Journal of Optimization Theory and Applications, 124(2), 2005, 503-510

Mathematics

Optimization and Control

9 pages, 2 figures

Scientific paper

In this paper, the problem of the minimal description of the structure of a vector function f(x) over an $N$-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied.

Affiliated with

Also associated with

No associations

Rating

Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms 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 Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-259562