Improved Lipschitz bounds with the first norm for function values over multidimensional simplex

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 pyrami...

Full description

Bibliographic Details
Main Authors: Remigijus Paulavičius, Julius Žilinskas
Format: Article
Language:English
Published: Vilnius Gediminas Technical University 2008-12-01
Series:Mathematical Modelling and Analysis
Subjects:
Online Access:https://journals.vgtu.lt/index.php/MMA/article/view/7045