Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints

Details Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints

2011-03-19

arxiv.org/abs/1103.3791v1

Journal of Global Optimization, 21(3) (2001) 317-341

Mathematics

Optimization and Control

26 pages, 5 figures

Scientific paper

In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A Branch-and-Bound method that does not use derivatives for solving the reduced problem is proposed. The method either determines the infeasibility of the original problem or finds lower and upper bounds for the global solution. Not all the constraints are evaluated during every iteration of the algorithm, providing a significant acceleration of the search. Convergence conditions of the new method are established. Test problems and extensive numerical experiments are presented.

Affiliated with

Also associated with

No associations

Rating

Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints 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 Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Index Branch-and-Bound Algorithm for Global Optimization with Multiextremal Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198794