Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
type: Item
instance of: scholarly article
title: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
zbMATH Open document ID: 1318.90057
author: Coralia Cartis
author: Jaroslav M. Fowkes
author: Nicholas I. M. Gould
published in: Journal of Global Optimization
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6419114
zbMATH Keywords: global optimization
zbMATH Keywords: Lipschitzian optimization
zbMATH Keywords: parallel branch and bound
zbMATH Keywords: nonconvex programming
MaRDI profile type: Publication
full work available at URL: s10898-014-0199-6
OpenAlex ID: W2132337079
cites work: Global optimization requires global information
cites work: Accelerations for global optimization covering methods using second derivatives
cites work: A deterministic algorithm for global optimization
cites work: Branch-and-Bound interval global optimization on shared memory multiprocessors
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Beyond convex? global optimization is feasible only for convex objective functions: a theorem
cites work: Benchmarking optimization software with performance profiles.
cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh)
cites work: An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
cites work: A deterministic approach to global box-constrained optimization
cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
cites work: A univariate global search working with a set of Lipschitz constants for the first derivative
cites work: A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
cites work: A global minimization algorithm for Lipschitz functions
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: Q3885544
cites work: Q4889854
cites work: Q4369384
cites work: Shifted Power Method for Computing Tensor Eigenpairs
cites work: Univariate geometric Lipschitz global optimization algorithms
cites work: Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
cites work: Introduction to global optimization
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: An algorithm for finding the absolute extremum of a function
cites work: Eigenvalues of a real supersymmetric tensor
cites work: Global one-dimensional optimization using smooth auxiliary functions
cites work: Introduction to Global Optimization Exploiting Space-Filling Curves
cites work: Global Optimization and Constraint Satisfaction
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: The cubic spherical optimization problems
DOI: 10.1007/S10898-014-0199-6
description: scientific article; zbMATH DE number 6419114