Globally-biased disimpl algorithm for expensive global optimization
type: Item
instance of: scholarly article
title: Globally-biased disimpl algorithm for expensive global optimization
zbMATH Open document ID: 1297.90130
author: Remigijus Paulavičius
author: Yaroslav D. Sergeyev
author: Dmitri E. Kvasov
author: Julius Žilinskas
published in: Journal of Global Optimization
publication date: 2014-07-04T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6313392
zbMATH Keywords: global optimization
zbMATH Keywords: Lipschitz condition
zbMATH Keywords: \textsc{Direct} algorithm
zbMATH Keywords: two-phase approach
zbMATH Keywords: globally-biased \textsc{Disimpl} algorithm
describes a project that uses: LGO
describes a project that uses: Algorithm 829
describes a project that uses: SymDIRECT
MaRDI profile type: Publication
full work available at URL: s10898-014-0180-4
OpenAlex ID: W2091785502
cites work: Using DIRECT to solve an aircraft routing problem
cites work: Algorithms for noisy problems in gas transmission pipeline optimization
cites work: On determining the cover of a simplex by spheres centered at its vertices
cites work: A comparison of global optimization methods for the design of a high-speed civil transport
cites work: Incorporating minimum Frobenius norm models in direct search
cites work: A modified DIviding RECTangles algorithm for a problem in astrophysics
cites work: Q4165315
cites work: Benchmarking optimization software with performance profiles.
cites work: Homogeneous algorithms for multiextremal optimization
cites work: A deterministic approach to global box-constrained optimization
cites work: Additive scaling and the \texttt{DIRECT} algorithm
cites work: Encyclopedia of Optimization
cites work: A locally-biased form of the DIRECT algorithm.
cites work: Algorithm 829
cites work: A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
cites work: Q3885544
cites work: Dynamic data structures for a direct search algorithm
cites work: Handbook of global optimization
cites work: Q4889854
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Local tuning and partition strategies for diagonal GO methods
cites work: A univariate global search working with a set of Lipschitz constants for the first derivative
cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
cites work: Univariate geometric Lipschitz global optimization algorithms
cites work: Lipschitz global optimization methods in control problems
cites work: Lipschitz and Hölder global optimization using space-filling curves
cites work: Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
cites work: Linear scaling and the DIRECT algorithm
cites work: A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Handbook of global optimization. Vol. 2
cites work: Simplicial Lipschitz optimization without the Lipschitz constant
cites work: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
cites work: Simplicial Global Optimization
cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: An Information Global Optimization Algorithm with Local Tuning
cites work: Global one-dimensional optimization using smooth auxiliary functions
cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Introduction to Global Optimization Exploiting Space-Filling Curves
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: The computation of fixed points and applications
cites work: Stochastic global optimization.
cites work: On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions
cites work: Global optimization based on a statistical model and simplicial partitioning.
cites work: A hybrid global optimization algorithm for nonlinear least squares regression
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
DOI: 10.1007/S10898-014-0180-4
description: scientific article