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...
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 |
Similar Items
-
Global optimization using the branch‐and‐bound algorithm with a combination of Lipschitz bounds over simplices
by: Remigijus Paulavičius, et al.
Published: (2009-06-01) -
Analysis of different norms and corresponding Lipschitz constants for global optimization
by: Remigijus Paulavičius, et al.
Published: (2006-12-01) -
Parallel Lipschitz Global Optimization Method
by: Alexey S. Gorbunov, et al.
Published: (2019-07-01) -
Template realization of generalized branch and bound algorithm
by: M. Baravykaite, et al.
Published: (2005-09-01) -
Novel Algorithm for Linearly Constrained Derivative Free Global Optimization of Lipschitz Functions
by: Linas Stripinis, et al.
Published: (2023-06-01)