A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
DOI10.1007/S10898-012-9937-9zbMATH Open1296.90090OpenAlexW2112341314MaRDI QIDQ2393063FDOQ2393063
Jaroslav M. Fowkes, C. L. Farmer, Nicholas I. M. Gould
Publication date: 7 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/manifestation/7168/RAL-TR-2011-020.pdf
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Title not available (Why is that?)
- The design and analysis of computer experiments.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A taxonomy of global optimization methods based on response surfaces
- Title not available (Why is that?)
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Introduction to Stochastic Search and Optimization
- Scattered Data Approximation
- Lipschitzian optimization without the Lipschitz constant
- Trust Region Methods
- Handbook of global optimization
- Handbook of global optimization. Vol. 2
- An algorithm for selecting a good value for the parameter \(c\) in radial basis function interpolation
- Introduction to global optimization
- Complete search in continuous global optimization and constraint satisfaction
- Title not available (Why is that?)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- On solving trust-region and other regularised subproblems in optimization
- Cubic regularization of Newton method and its global performance
- Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Hierarchical Nonlinear Approximation for Experimental Design and Statistical Data Fitting
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
Cited In (8)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Convexity and solvability for compactly supported radial basis functions with different shapes
- SCORE: approximating curvature information under self-concordant regularization
- 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
- An algorithm for global optimization of Lipschitz continuous functions
- (Global) optimization: historical notes and recent developments
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients
Uses Software
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)
