An Ellipsoidal Branch and Bound Algorithm for Global Optimization
From MaRDI portal
Abstract: A branch and bound algorithm is developed for global optimization. Branching in the algorithm is accomplished by subdividing the feasible set using ellipses. Lower bounds are obtained by replacing the concave part of the objective function by an affine underestimate. A ball approximation algorithm, obtained by generalizing of a scheme of Lin and Han, is used to solve the convex relaxation of the original problem. The ball approximation algorithm is compared to SEDUMI as well as to gradient projection algorithms using randomly generated test problems with a quadratic objective and ellipsoidal constraints.
Recommendations
- An objective-function ellipsoid-algorithm for convex quadraical programming
- Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
- Computing a Trust Region Step
- A Class of Methods for Projection on the Intersection of Several Ellipsoids
- scientific article; zbMATH DE number 1150370
- Implicitly restarted projection algorithm for solving optimization problems
- scientific article; zbMATH DE number 3858834
- A class of methods for projection on a convex set
- Minimization of convex functions on the convex hull of a point set
- scientific article; zbMATH DE number 4080780
Cited in
(13)- Target-oriented branch and bound method for global optimization
- Convex envelopes of separable functions over regions defined by separable functions of the same type
- An exact algorithm for graph partitioning
- Deterministic and stochastic global optimization techniques for planar covering with ellipses problems
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Circumscribed ellipsoid algorithm for fixed-point problems
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Globally optimal bounding ellipsoid algorithm for parameter estimation using artificial neural networks
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes
- scientific article; zbMATH DE number 6452509 (Why is no real title available?)
- (Global) optimization: historical notes and recent developments
- An outer space approximation approach for generalized affine multiplicative programming problems
This page was built for publication: An Ellipsoidal Branch and Bound Algorithm for Global Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563904)
