IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- 31 December 2008
- journal article
- Published by Vilnius Gediminas Technical University in Mathematical Modelling and Analysis
- Vol. 13 (4)
Abstract
A branch and bound algorithm for global optimization is proposed, where the maximum of an upper bounding function based on Lipschitz condition and the first norm over a simplex is used as the upper bound of function. In this case the graph of bounding function is intersection of n‐dimensional pyramids and its maximum point is found solving a system of linear equations. The efficiency of the proposed global optimization algorithm is evaluated experimentally.Keywords
This publication has 22 references indexed in Scilit:
- AN IMPLEMENTATION OF A PARALLEL GENERALIZED BRANCH AND BOUND TEMPLATEMathematical Modelling and Analysis, 2007
- Convergence rates of a global optimization algorithmMathematical Programming, 1992
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimizationJournal of Optimization Theory and Applications, 1988
- An algorithm for global optimization of Lipschitz continuous functionsJournal of Optimization Theory and Applications, 1988
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structureOptimization, 1988
- On the convergence of global methods in multiextremal optimizationJournal of Optimization Theory and Applications, 1987
- Extended univariate algorithms for n-dimensional global optimizationComputing, 1986
- An algorithm for finding the global maximum of a multimodal, multivariate functionMathematical Programming, 1986
- The cubic algorithmJournal of Mathematical Analysis and Applications, 1985
- Outer approximation algorithm for nondifferentiable optimization problemsJournal of Optimization Theory and Applications, 1984