Optimization Online


On the Globally Concavized Filled Function Method

Wenxing Zhu (wxzhu***at***fzu.edu.cn)

Abstract: In this paper we present a new definition on the globally concavized filled function for the continuous global minimization problem, which was modified from that by Ge [3]. A new class of globally concavized filled functions are constructed. These functions contain two easily determinable parameters, which are not dependent on the radius of the basin at the current local minimizer. A randomized algorithm is designed to solve the box constrained continuous global minimization problem basing on the globally concavized filled functions, which can converge asymptotically with probability one to a global minimizer of the problem. Preliminary numerical experiments are presented to show the practicability of the algorithm.

Keywords: Box constrained continuous global minimization problem, Globally concavized filled function, Asymptotic convergence, Stopping rule.

Category 1: Global Optimization

Category 2: Global Optimization (Theory )

Citation: Department of Computer Science and Technology, Fuzhou University, Fuzhou 350002, China

Download: [PDF]

Entry Submitted: 05/25/2004
Entry Accepted: 05/26/2004
Entry Last Modified: 05/25/2004

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society