A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
From MaRDI portal
Publication:2393063
Recommendations
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Some problems of solving Lipschitzian global optimization problems using the branch and bound method
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
Cites work
- scientific article; zbMATH DE number 3583145 (Why is no real title available?)
- scientific article; zbMATH DE number 1313649 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 928746 (Why is no real title available?)
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- A taxonomy of global optimization methods based on response surfaces
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
- Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
- Complete search in continuous global optimization and constraint satisfaction
- Cubic regularization of Newton method and its global performance
- Gaussian processes for machine learning.
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- Hierarchical Nonlinear Approximation for Experimental Design and Statistical Data Fitting
- Introduction to Stochastic Search and Optimization
- Introduction to global optimization
- Lipschitzian optimization without the Lipschitz constant
- On solving trust-region and other regularised subproblems in optimization
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Scattered Data Approximation
- The design and analysis of computer experiments.
- Trust Region Methods
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(8)- (Global) optimization: historical notes and recent developments
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- Convexity and solvability for compactly supported radial basis functions with different shapes
- An algorithm for global optimization of Lipschitz continuous functions
- SCORE: approximating curvature information under self-concordant regularization
This page was built for publication: A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2393063)
