Diagonal generalizaton of the DIRECT method for problems with constraints
From MaRDI portal
Recommendations
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- The DIRECT algorithm: 25 years later
- scientific article; zbMATH DE number 1795727
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- A DIRECT-type approach for derivative-free constrained global optimization
Cites work
- scientific article; zbMATH DE number 3776767 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3805340 (Why is no real title available?)
- A locally-biased form of the DIRECT algorithm.
- A univariate global search working with a set of Lipschitz constants for the first derivative
- 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 with non-convex constraints. Sequential and parallel algorithms
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Lipschitzian optimization without the Lipschitz constant
- Parallel global optimization of functions of several variables
- Pareto optimal generalized \(H_2\)-control and vibroprotection problems
- Synthesis of control laws on the basis of matrix inequalities
- \(H_\infty\) control and estimation of state-multiplicative linear systems.
Cited in
(6)- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Multidimensional global extremum seeking via the DIRECT optimisation algorithm
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- AN EXTENSION OF LEITMANN'S DIRECT METHOD TO INEQUALITY CONSTRAINTS
- Diagonalizability of constraint propagation matrices
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
This page was built for publication: Diagonal generalizaton of the DIRECT method for problems with constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828532)
