Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
From MaRDI portal
Publication:5122335
DOI10.1007/978-3-030-40616-5_46OpenAlexW3005622568MaRDI QIDQ5122335
Semen Bevzuk, Konstantin Barkalov, Roman G. Strongin
Publication date: 22 September 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_46
Related Items (2)
Adaptive Gradient-Free Method for Stochastic Optimization ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
Uses Software
Cites Work
- Unnamed Item
- Parallel global optimization on GPU
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- A deterministic global optimization using smooth diagonal auxiliary functions
- 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
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A deterministic approach to global box-constrained optimization
- An information global minimization algorithm using the local improvement technique
- Introduction to Global Optimization Exploiting Space-Filling Curves
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A locally-biased form of the DIRECT algorithm.
This page was built for publication: Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
