Multidimensional Lipschitz global optimization based on efficient diagonal partitions

DOI10.1007/S10288-007-0065-1MaRDI QIDQ1029568zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 5707333
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• scientific article; zbMATH DE number 1795727
• Deterministic global optimization. An introduction to the diagonal approach
• A deterministic global optimization using smooth diagonal auxiliary functions

Cites work

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

Cited in

(4)

• scientific article; zbMATH DE number 5707333 (Why is no real title available?)
• On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
• The DIRECT algorithm: 25 years later
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case

Describes a project that uses

Uses Software

• Algorithm 829
• DIRECT
• LGO

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

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