A simplicial homology algorithm for Lipschitz optimisation
From MaRDI portal
Publication:1756767
DOI10.1007/s10898-018-0645-yzbMath1414.90284OpenAlexW2795213472WikidataQ130063407 ScholiaQ130063407MaRDI QIDQ1756767
Stefan C. Endres, Walter W. Focke, Carl Sandrock
Publication date: 21 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2263/64460
Related Items (5)
On computing the hyperparameter of extreme learning machines: algorithm and application to computational PDEs, and comparison with classical and high-order finite elements ⋮ On K3-fibred LARGE volume scenario with de Sitter vacua from anti-D3-branes ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ SHGO ⋮ Controlling reaction dynamics in chemical model systems through external driving
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topographical global initialization for finding all solutions of nonlinear systems with constraints
- Survey of modeling and optimization strategies to solve high-dimensional design problems with computationally-expensive black-box functions
- A literature survey of benchmark functions for global optimisation problems
- Sperner labellings: A combinatorial approach
- Feasible direction interior-point technique for nonlinear optimization
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- A polytopal generalization of Sperner's lemma
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- Extensions of Sperner and Tucker's lemma for manifolds
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Simplicial Global Optimization
- PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- An economic method of computing LPτ-sequences
- The quickhull algorithm for convex hulls
- Algorithm 733: TOMP–Fortran modules for optimal control calculations
- On the distribution of points in a cube and the approximate evaluation of integrals
- Benchmarking optimization software with performance profiles.
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
This page was built for publication: A simplicial homology algorithm for Lipschitz optimisation
