IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX

DOI10.3846/1392-6292.2008.13.553-563zbMath1182.90073OpenAlexW2023586799MaRDI QIDQ3604157

Julius Žilinskas, Remigijus Paulavičius

Publication date: 24 February 2009

Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3846/1392-6292.2008.13.553-563

zbMATH Keywords

first norm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (3)

P-algorithm based on a simplicial statistical model of multimodal functions ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds

This page was built for publication: IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX