首页 | 本学科首页   官方微博 | 高级检索  
     


A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
Authors:Yaroslav D. Sergeyev  Dmitri E. Kvasov  Falah M. H. Khalaf
Affiliation:(1) DEIS, University of Calabria, Via P. Bucci, 42C, 87036 Rende, (CS), Italy;(2) Software Department, N.I. Lobatchevsky State University, Nizhni Novgorod, Russia;(3) Department of Mathematics, University of Calabria, Calabria, Italy
Abstract:
Lipschitz one-dimensional constrained global optimization (GO) problems where both the objective function and constraints can be multiextremal and non-differentiable are considered in this paper. Problems, where the constraints are verified in a priori given order fixed by the nature of the problem are studied. Moreover, if a constraint is not satisfied at a point, then the remaining constraints and the objective function can be undefined at this point. The constrained problem is reduced to a discontinuous unconstrained problem by the index scheme without introducing additional parameters or variables. A new geometric method using adaptive estimates of local Lipschitz constants is introduced. The estimates are calculated by using the local tuning technique proposed recently. Numerical experiments show quite a satisfactory performance of the new method in comparison with the penalty approach and a method using a priori given Lipschitz constants.This research was supported by the following grants: FIRB RBNE01WBBB, FIRB RBAU01JYPN, PRIN 2005017083-002, and RFBR 04-01-00455-a. The authors would like to thank anonymous referees for their subtle suggestions.
Keywords:Global optimization  Multiextremal constraints  Geometric algorithms  Index scheme  Local tuning
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号