An Ellipsoidal Branch and Bound Algorithm for Global Optimization

DOI10.1137/080729165zbMath1198.90318arXiv0912.1673OpenAlexW2081411394MaRDI QIDQ3563904

William W. Hager, Dzung T. Phan

Publication date: 1 June 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0912.1673

zbMATH Keywords

global optimizationbranch and boundconvex relaxationweakly convexaffine underestimationball approximation

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (6)

Convex envelopes of separable functions over regions defined by separable functions of the same type ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ (Global) optimization: historical notes and recent developments ⋮ An exact algorithm for graph partitioning ⋮ Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization

Uses Software

• SPG
• SeDuMi
• NAPACK

This page was built for publication: An Ellipsoidal Branch and Bound Algorithm for Global Optimization