Mathematics – Optimization and Control
Scientific paper
2011-07-26
Computational Optimization and Applications, 34(2), 229-248 (2006)
Mathematics
Optimization and Control
19 pages, 5 figures, 3 tables
Scientific paper
This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextremal Lipschitz functions. Multiextremal constraints can lead to complex feasible regions being collections of isolated points and intervals having positive lengths. The case is considered where the order the constraints are evaluated is fixed by the nature of the problem and a constraint $i$ is defined only over the set where the constraint $i-1$ is satisfied. The objective function is defined only over the set where all the constraints are satisfied. In contrast to traditional approaches, the new algorithm does not use any additional parameter or variable. All the constraints are not evaluated during every iteration of the algorithm providing a significant acceleration of the search. The new algorithm either finds lower and upper bounds for the global optimum or establishes that the problem is infeasible. Convergence properties and numerical experiments showing a nice performance of the new method in comparison with the penalty approach are given.
No associations
LandOfFree
Univariate global optimization with multiextremal non-differentiable constraints without penalty functions 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 Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Univariate global optimization with multiextremal non-differentiable constraints without penalty functions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-94206