Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties

Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties

Bibliographic Details
Main Authors:	Cartis, C, Fowkes, J, Gould, N
Format:	Journal article
Published:	Springer 2015

Similar Items

A Branch and Bound Algorithm for the Global Optimization of Hessian Lipschitz Continuous Functions
by: Fowkes, J, et al.
Published: (2012)

A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
by: Fowkes, J, et al.
Published: (2012)

Continuity of extensions of Lipschitz maps
by: Ciosmak, K
Published: (2021)

Complexity bounds for second-order optimality in unconstrained optimization.
by: Cartis, C, et al.
Published: (2012)

On the theory of Lipschitz continuous machine learning
by: Huang, JW
Published: (2023)

Lipschitz optimisation for Lipschitz Interpolation
by: Calliess, J
Published: (2017)

Vectorial problems: sharp Lipschitz bounds and borderline regularity
by: De filippis, C
Published: (2020)

Lower bounds for the query complexity of equilibria in Lipschitz games
by: Goldberg, PW, et al.
Published: (2023)

Gaussian Process Planning with Lipschitz Continuous Reward Functions
by: Ling, Chun Kai, et al.
Published: (2017)

Optimal transport and 1-Lipschitz maps
by: Ciosmak, K
Published: (2020)

Vector-valued optimal Lipschitz extensions
by: Sheffield, Scott Roger, et al.
Published: (2013)

Nonautonomous locally Lipschitz continuous functional differential equations in spaces of continuous functions
by: Dyson, J, et al.
Published: (1996)

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
by: Cartis, C, et al.
Published: (2020)

Global Continuous Optimization with Error Bound and Fast Convergence
by: Maruyama, Yu, et al.
Published: (2017)

Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models
by: Cartis, C, et al.
Published: (2019)

Adaptive timestepping for SDEs with non-globally Lipschitz drift
by: Fang, W
Published: (2019)

Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
by: Cartis, C, et al.
Published: (2017)

Adaptive algorithms for problems involving black-box Lipschitz functions
by: Baran, Ilya, 1981-
Published: (2005)

Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
by: Cartis, C, et al.
Published: (2022)

An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
by: Cartis, C, et al.
Published: (2012)

Lipschitz geometry and rough paths
by: Boutaib, Y
Published: (2016)

On the gradient set of Lipschitz maps
by: Kirchheim, B, et al.
Published: (2008)

Adaptive Euler-Maruyama method for SDEs with non-globally Lipschitz drift
by: Giles, M, et al.
Published: (2020)

Adaptive Euler-Maruyama method for SDEs with non-globally Lipschitz drift
by: Giles, M, et al.
Published: (2018)

Sampling-based adaptive bounding evolutionary algorithm for continuous optimization problems
by: Luo, Linbo, et al.
Published: (2017)

Convergence-order analysis of branch-and-bound algorithms for constrained problems
by: Barton, Paul I, et al.
Published: (2018)

Analysing multi-level Monte Carlo for options with non-globally Lipschitz payoff
by: Giles, M, et al.
Published: (2009)

Lipschitz bijections between boolean functions
by: Johnston, T, et al.
Published: (2020)

Higher order Lipschitz Sandwich theorems
by: Lyons, T, et al.
Published: (2024)

Higher order Lipschitz Sandwich theorems
by: Lyons, T, et al.
Published: (2025)

The complexity of solution concepts in Lipschitz games
by: Katzman, M
Published: (2022)

Optimal well placement
by: Farmer, C, et al.
Published: (2010)

A Branch-and-Bound Algorithm for Quadratically-Constrained Sparse Filter Design
by: Wei, Dennis, et al.
Published: (2014)

Optimal Multilateral Well Placement
by: Farmer, C, et al.
Published: (2010)

Bounded Width Branching Programs
by: Barrington, David A.
Published: (2023)

Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization
by: Cartis, C, et al.
Published: (2017)

A Lipschitz metric for the Camassa–Holm equation
by: Carrillo, JA, et al.
Published: (2020)

A Lipschitz metric for the Hunter–Saxton equation
by: Carrillo de la Plata, JA, et al.
Published: (2019)

Branch and bound methods for combinatorial problems.
by: Little, John D. C.
Published: (2009)

Bayesian numerical analysis: global optimization and other applications
by: Fowkes, J
Published: (2011)