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.
Similar content being viewed by others
References
Bertsekas D.P. (1996): Constrained Optimization and Lagrange Multiplier Methods. Athena Scientific, Belmont
Famularo D., Sergeyev Ya.D., Pugliese P. (2002): Test problems for Lipschitz Univariate Global Optimization with multiextremal constraints. In: Dzemyda G., Šaltenis V., Žilinskas A. (eds). Stochastic and Global Optimization. Kluwer, Dordrecht, pp. 93–110
Horst R., Pardalos P.M. (1995): Handbook of Global Optimization. Kluwer, Dordrecht
Nocedal J., Wright S.J.(1999): Numerical optimization. In: Springer Series in Operations Research. Springer, Berlin Heidelberg New York
Pijavskii S.A. (1972): An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12, 57–67
Pintér J.D. (1996): Global Optimization in Action. Kluwer, Dordrecth
Sergeyev Ya.D. (1995a): An information global optimization algorithm with local tuning. SIAM J. 5, 858–870
Sergeyev Ya.D. (1995b): A one-dimensional deterministic global minimization algorithm. Comput. Math. Math. Phys. 35, 705–717
Sergeyev Ya.D.(1998): Global one-dimensional optimization using smooth auxiliary functions. Math. Program. 81, 127–146
Sergeyev Ya.D., Markin D.L. (1995): An algorithm for solving global optimization problems with nonlinear constraints. J. Global Optim. 7, 407–419
Sergeyev Ya.D., Famularo D., Pugliese P. (2001): Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints. J. Global Optim. 21, 317–341
Strongin R.G. (1978): Numerical Methods on Multiextremal Problems. Nauka, Moscow (In Russian)
StronginR.G. (1984): Numerical methods for multiextremal nonlinear programming problems with nonconvex constraints. In: Demyanov V.F., Pallaschke D. (eds). Lecture Notes in Economics and Mathematical Systems. vol. 255, Proceedings 1984, Springer, Berlin Heidelberg New York, IIASA, Laxenburg/Austria pp. 278–282.
Strongin R.G., Markin D.L. (1986): Minimization of multiextremal functions with nonconvex constraints. Cybernetics 22, 486–493
Strongin R.G., Sergeyev Ya.D. (2000): Global Optimization with Non-Convex Constraints: Sequential and Parallel Algorithms. Kluwer, Dordrecht
Author information
Authors and Affiliations
Corresponding author
Additional information
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.
Rights and permissions
About this article
Cite this article
Sergeyev, Y.D., Kvasov, D.E. & Khalaf, F.M.H. A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints. Optimization Letters 1, 85–99 (2007). https://doi.org/10.1007/s11590-006-0015-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-006-0015-4