Deterministic global optimization. Geometric branch-and-bound methods and their applications

DOI10.1007/978-1-4614-1951-8zbMath1237.90002OpenAlexW2483998465MaRDI QIDQ642467

Daniel Scholz

Publication date: 26 October 2011

Published in: Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1951-8

zbMATH Keywords

global optimizationlocation theorymulti-objective optimizationconvergence theorygeometric branch-and bound

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (16)

Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ New external estimate for the reachable set of a nonlinear multistep dynamic system ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ Geometric branch-and-bound methods for constrained global optimization problems ⋮ A branch-and-bound approach for estimating covering functionals of convex bodies ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables ⋮ Branch and probability bound methods in multi-objective optimization ⋮ Nonconvex constrained optimization by a filtering branch and bound ⋮ Steklov regularization and trajectory methods for univariate global optimization

This page was built for publication: Deterministic global optimization. Geometric branch-and-bound methods and their applications