A simplicial homology algorithm for Lipschitz optimisation
type: Item
instance of: scholarly article
title: A simplicial homology algorithm for Lipschitz optimisation
zbMATH Open document ID: 1414.90284
author: Stefan C. Endres
author: Carl Sandrock
author: Walter W. Focke
published in: Journal of Global Optimization
publication date: 2018-12-21T00:00:00Z
full work available at URL: http://hdl.handle.net/2263/64460
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6996788
zbMATH Keywords: global optimisation
zbMATH Keywords: SHGO
zbMATH Keywords: computational homology
zbMATH Keywords: simplicial homology global optimisation
describes a project that uses: MVF
describes a project that uses: TGO
describes a project that uses: PSwarm
describes a project that uses: MCS
describes a project that uses: AMPGO
describes a project that uses: Qhull
describes a project that uses: LGO
describes a project that uses: TOMP
describes a project that uses: SciPy
describes a project that uses: DIRECT
describes a project that uses: MultiMin
describes a project that uses: UQToolbox
describes a project that uses: DFVLR-SQP
describes a project that uses: Python
MaRDI profile type: Publication
OpenAlex ID: W2795213472
cites work: An economic method of computing LPτ-sequences
cites work: Q4892306
cites work: The quickhull algorithm for convex hulls
cites work: A polytopal generalization of Sperner's lemma
cites work: Benchmarking optimization software with performance profiles.
cites work: Q5813687
cites work: Q4819371
cites work: Topographical global initialization for finding all solutions of nonlinear systems with constraints
cites work: Q3041977
cites work: Feasible direction interior-point technique for nonlinear optimization
cites work: Global optimization by multilevel coordinate search
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Q3790948
cites work: Algorithm 733: TOMP–Fortran modules for optimal control calculations
cites work: Q4767350
cites work: Sperner labellings: A combinatorial approach
cites work: Extensions of Sperner and Tucker's lemma for manifolds
cites work: Simplicial Lipschitz optimization without the Lipschitz constant
cites work: Simplicial Global Optimization
cites work: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: Q4353366
cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations
cites work: Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
cites work: On the distribution of points in a cube and the approximate evaluation of integrals
cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
cites work: Q5688509
cites work: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
Wikidata QID: Q130063407
DOI: 10.1007/S10898-018-0645-Y
description: scientific article; zbMATH DE number 6996788