Solving a set of global optimization problems by the parallel technique with uniform convergence
From MaRDI portal
Publication:1754445
DOI10.1007/S10898-017-0555-4zbMATH Open1402.90124OpenAlexW2750444590MaRDI QIDQ1754445FDOQ1754445
Authors: 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
Recommendations
- Global multidimensional optimization on parallel computer
- Parallel information algorithm with local tuning for solving multidimensional GO problems
- Parallel characteristical algorithms for solving problems of global optimization
- A parallel method for finding the global minimum of univariate functions
- scientific article; zbMATH DE number 4068628
Cites Work
- Algorithm 829
- Design and implementation of a massively parallel version of DIRECT
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Multicriteria Optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- On the worst-case optimal multi-objective global optimization
- 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
- Globally-biased disimpl algorithm for expensive global optimization
- Introduction to global optimization exploiting space-filling curves
- Parallel global optimization on GPU
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Parallel global optimization of functions of several variables
- Title not available (Why is that?)
- Index branch-and-bound algorithm for Lipschitz univariate global optimization with multiextremal constraints
- A deterministic approach to global box-constrained optimization
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Cited In (10)
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- A parallel constrained efficient global optimization algorithm for expensive constrained optimization problems
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- A parallel global optimization method and its implementation on a transputer system
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework
- A global minimization algorithm with parallel iterations
- Parallel characteristical algorithms for solving problems of global optimization
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
Uses Software
This page was built for publication: Solving a set of global optimization problems by the parallel technique with uniform convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754445)
