Multidimensional Lipschitz global optimization based on efficient diagonal partitions

DOI10.1007/s10288-007-0065-1zbMath1179.90263OpenAlexW2053851163MaRDI QIDQ1029568

Dmitri E. Kvasov

Publication date: 13 July 2009

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0065-1

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Related Items (3)

Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ The DIRECT algorithm: 25 years later ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients

Uses Software

• LGO
• DIRECT
• Algorithm 829

Cites Work

• Local tuning and partition strategies for diagonal GO methods
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
• Algorithm 829
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms

This page was built for publication: Multidimensional Lipschitz global optimization based on efficient diagonal partitions