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

DOI10.3846/1392-6292.2008.13.553-563MaRDI QIDQ3604157zbMATH OpenOpenAlexFDO

Authors Remigijus Paulavičius, Julius Žilinskas

Publication date 24 February 2009

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Some problems of solving Lipschitzian global optimization problems using the branch and bound method
• Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• A new bounding algorithm for solving Lipschitz optimization problem with box constraints

Cited in

(9)

• Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
• DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
• An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
• On derivative based bounding for simplicial branch and bound
• An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
• P-algorithm based on a simplicial statistical model of multimodal functions
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604157)