Local tuning and partition strategies for diagonal GO methods
From MaRDI portal
Publication:1402152
DOI10.1007/S00211-002-0419-8zbMath1056.65059arXiv1103.3665OpenAlexW2963378486MaRDI QIDQ1402152
Clara Pizzuti, Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publication date: 19 August 2003
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.3665
algorithmglobal optimizationglobal convergencenumerical resultsbisection strategydiagonal methodshyperinterval
Related Items (24)
Adaptive nested optimization scheme for multidimensional global search ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods ⋮ The DIRECT algorithm: 25 years later ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Multidimensional Lipschitz global optimization based on efficient diagonal partitions ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
This page was built for publication: Local tuning and partition strategies for diagonal GO methods
