On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
From MaRDI portal
Publication:2660812
DOI10.1016/j.amc.2020.125596zbMath1474.90361OpenAlexW3080596021MaRDI QIDQ2660812
Remigijus Paulavičius, Julius Žilinskas, Linas Stripinis, Leocadio G. Casado
Publication date: 31 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2020.125596
derivative-free optimizationdynamic data structuresparallel optimizationparallel \texttt{MATLAB}parallel computing toolbox\texttt{DIRECT}-type algorithm
Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization, Preface to the virtual special issue recent developments in applied mathematics and computation, A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints, DIRECT-GLce
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained efficient global optimization with support vector machines
- On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
- 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
- An approach to constrained global optimization based on exact penalty functions
- Filter-based DIRECT method for constrained global optimization
- Additive scaling and the \texttt{DIRECT} algorithm
- Design and implementation of a massively parallel version of DIRECT
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- MATLAB\(^{\circledR}\): A language for parallel computing
- Global multidimensional optimization on parallel computer
- Lipschitzian optimization without the Lipschitz constant
- A parallel method for finding the global minimum of univariate functions
- Parallel characteristical algorithms for solving problems of global optimization
- Global optimization: Fractal approach and non-redundant parallelism
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Handbook of global optimization. Vol. 2
- On parallel branch and bound frameworks for global optimization
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Dynamic data structures for a direct search algorithm
- Algorithms for noisy problems in gas transmission pipeline optimization
- MatlabMPI
- Introduction to global optimization
- 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
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- A DIRECT-type approach for derivative-free constrained global optimization
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
- A fully‐distributed parallel global search algorithm
- Remark on Algorithm 897
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- A global minimization algorithm with parallel iterations
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- On convergence of "divide the best" global optimization algorithms
- Deterministic Global Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global optimization
- Nonlinear programming without a penalty function.
- A locally-biased form of the DIRECT algorithm.
- Using DIRECT to solve an aircraft routing problem
