Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
From MaRDI portal
Publication:1800457
DOI10.1007/s11590-017-1228-4zbMath1407.90264OpenAlexW2780551984MaRDI QIDQ1800457
Linas Stripinis, Remigijus Paulavičius, Julius Žilinskas
Publication date: 23 October 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1228-4
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ The DIRECT algorithm: 25 years later ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ A THREE-LEVEL PARALLELISATION SCHEME AND APPLICATION TO THE NELDER-MEAD ALGORITHM
Uses Software
Cites Work
- Unnamed Item
- A modified DIRECT algorithm with bilevel partition
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Improving the convergence rate of the DIRECT global optimization algorithm
- Additive scaling and the \texttt{DIRECT} algorithm
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A partition-based global optimization algorithm
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Simplicial Global Optimization
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
- An algorithm for finding the absolute extremum of a function
- On convergence of "divide the best" global optimization algorithms
- Deterministic Global Optimization
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- A locally-biased form of the DIRECT algorithm.
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
