𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cut-peak function method for global optimization

✍ Scribed by Yuncheng Wang; Weiwu Fang; Tianjiao Wu


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
497 KB
Volume
230
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis


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 auxiliary minimization problem of finding local minimizers of the choice function, whose objective function values are smaller than the previous ones. For a local minimum solution of auxiliary problems this procedure is repeated until no new minimizer with a smaller objective function value could be found for the last minimizer. Construction of auxiliary problems and choice of parameters are relatively simple, so the algorithm is relatively easy to implement, and the results of the numerical tests are satisfactory compared to other methods.


πŸ“œ SIMILAR VOLUMES


A new filled function method for unconst
✍ Chengjun Wang; Yongjian Yang; Jing Li πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 585 KB

In this paper, a new filled function which has better properties is proposed for identifying a global minimum point for a general class of nonlinear programming problems within a closed bounded domain. An algorithm for unconstrained global optimization is developed from the new filled function. Theo

Cutting angle methods in global optimiza
✍ M. Andramonov; A. Rubinov; B. Glover πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 381 KB

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 minimi

A filled function method applied to nons
✍ Ying Zhang; Yingtao Xu; Liansheng Zhang πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 607 KB

The filled function method is an effective approach to find a global minimizer. In this paper, based on a new definition of the filled function for nonsmooth constrained programming problems, a one-parameter filled function is constructed to improve the efficiency of numerical computation. Then a co

Global optimization method for controlli
✍ OgΓΌn Tiğli; Ibrahim Eksin; Suat Ertem; Olcay Boz πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 404 KB

A control system that contains a generic plant has been built. Its controller parameters have been designed by using a global search algorithm for a given plant, and its performance has been evaluated for the heat control of a thermal system, and the speed control of a DC motor. This paper explains