Lipschitz gradients for global optimization in a one-point-based partitioning scheme
type: Item
instance of: scholarly article
title: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
zbMATH Open document ID: 1246.65091
author: Dmitri E. Kvasov
author: Yaroslav D. Sergeyev
published in: Journal of Computational and Applied Mathematics
publication date: 2012-07-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/1307.4302
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 6053794
zbMATH Keywords: global optimization
zbMATH Keywords: Lipschitz gradients
zbMATH Keywords: set of Lipschitz constants
zbMATH Keywords: geometric algorithms
zbMATH Keywords: algorithm
zbMATH Keywords: numerical experiments
describes a project that uses: LGO
describes a project that uses: TRIOPT
describes a project that uses: Algorithm 829
describes a project that uses: EGO
describes a project that uses: DIRECT
MaRDI profile type: Publication
OpenAlex ID: W2107530185
arXiv ID: 1307.4302
cites work: Recent developments and trends in global optimization
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Stochastic global optimization.
cites work: Essays and Surveys in Global Optimization
cites work: A fully adaptive hybrid optimization of aircraft engine blades
cites work: A metamodel-assisted evolutionary algorithm for expensive optimization
cites work: A set of examples of global and discrete optimization. Applications of Bayesian heuristic approach
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: A global minimization algorithm for Lipschitz functions
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Handbook of global optimization
cites work: Q4889854
cites work: Q3652457
cites work: Q5317017
cites work: Local tuning and partition strategies for diagonal GO methods
cites work: An Information Global Optimization Algorithm with Local Tuning
cites work: Additive scaling and the \texttt{DIRECT} algorithm
cites work: A locally-biased form of the DIRECT algorithm.
cites work: Dynamic data structures for a direct search algorithm
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: A partition-based global optimization algorithm
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: A modified DIviding RECTangles algorithm for a problem in astrophysics
cites work: Surface passivation optimization using DIRECT
cites work: Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
cites work: A univariate global search working with a set of Lipschitz constants for the first derivative
cites work: An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
cites work: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms
cites work: A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
cites work: Lipschitz and Hölder global optimization using space-filling curves
cites work: TRIOPT: A triangulation-based partitioning algorithm for global optimization
cites work: Efficient global optimization of expensive black-box functions
cites work: An information global minimization algorithm using the local improvement technique
cites work: Customizing methods for global optimization -- a geometric viewpoint
cites work: Global one-dimensional optimization using smooth auxiliary functions
cites work: Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
cites work: A deterministic algorithm for global optimization
cites work: Algorithm 829
cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
cites work: Numerical Optimization
cites work: A Complexity Analysis of Local Search Algorithms in Global Optimization
DOI: 10.1016/J.CAM.2012.02.020
description: scientific article; zbMATH DE number 6053794