Solving a set of global optimization problems by the parallel technique with uniform convergence
From MaRDI portal
Publication:1754445
DOI10.1007/s10898-017-0555-4zbMath1402.90124OpenAlexW2750444590MaRDI QIDQ1754445
Konstantin Barkalov, Roman G. Strongin
Publication date: 30 May 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0555-4
Related Items (6)
Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel global optimization on GPU
- On the worst-case optimal multi-objective global optimization
- 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
- A parallel method for finding the global minimum of univariate functions
- Parallel characteristical algorithms for solving problems of global optimization
- Local tuning and partition strategies for diagonal GO methods
- Global optimization: Fractal approach and non-redundant parallelism
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A deterministic approach to global box-constrained optimization
- Globally-biased disimpl algorithm for expensive global optimization
- Introduction to Global Optimization Exploiting Space-Filling Curves
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Multicriteria Optimization
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
This page was built for publication: Solving a set of global optimization problems by the parallel technique with uniform convergence
