Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
From MaRDI portal
Publication:6130868
DOI10.1007/978-3-030-65739-0_4OpenAlexW3121616673MaRDI QIDQ6130868
Vladislav Sovrasov, Konstantin Barkalov
Publication date: 3 April 2024
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-65739-0_4
global optimizationuniform convergenceparallel computingderivative-free optimizationnonconvex constraints
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Best practices for comparing optimization algorithms
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Piyavskij's method for solving the general global optimization problem
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- A deterministic approach to global box-constrained optimization
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Deterministic Global Optimization
- Multicriteria Optimization
- Algorithm 829