๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Cutting angle methods in global optimization

โœ Scribed by M. Andramonov; A. Rubinov; B. Glover

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
381 KB
Volume
12
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

A generalization of the cutting plane method from convex minimization is proposed applicable to a very broad class of nonconvex global optimization problems. Convergence-results are described along with details of the initial numerical implementation of the algorithms. In particular, we study minimization problems in which the objective function is increasing and convex-along-rays.

๐Ÿ“œ SIMILAR VOLUMES

A cut-peak function method for global op
A cut-peak function method for global optimization
โœ Yuncheng Wang; Weiwu Fang; Tianjiao Wu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 497 KB

A new method is proposed for solving box constrained global optimization problems. The basic idea of the method is described as follows: Constructing a so-called cut-peak function and a choice function for each present minimizer, the original problem of finding a global solution is converted into an