Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
From MaRDI portal
Publication:2018512
DOI10.1007/s10898-014-0199-6zbMath1318.90057OpenAlexW2132337079MaRDI QIDQ2018512
Nicholas I. M. Gould, Jaroslav M. Fowkes, Coralia Cartis
Publication date: 24 March 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0199-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms, Some inequalities on the spectral radius of nonnegative tensors, (Global) optimization: historical notes and recent developments, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Univariate geometric Lipschitz global optimization algorithms
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Global optimization requires global information
- Global one-dimensional optimization using smooth auxiliary functions
- Accelerations for global optimization covering methods using second derivatives
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- A deterministic algorithm for global optimization
- Introduction to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- A deterministic approach to global box-constrained optimization
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Eigenvalues of a real supersymmetric tensor
- A global minimization algorithm for Lipschitz functions
- Introduction to Global Optimization Exploiting Space-Filling Curves
- The cubic spherical optimization problems
- An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems
- Shifted Power Method for Computing Tensor Eigenpairs
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- An algorithm for finding the absolute extremum of a function
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Complete search in continuous global optimization and constraint satisfaction
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- A Sequential Method Seeking the Global Maximum of a Function
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Global Optimization and Constraint Satisfaction
- Benchmarking optimization software with performance profiles.
