• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Zhu, WX (Zhu, WX.) [1] (Scholars:朱文兴)

Indexed by:

EI Scopus SCIE

Abstract:

In this paper we show that the unconstrained continuous global minimization problem cannot be solved by any algorithm, so we consider the box constrained continuous global minimization problem. We present a definition of filled function for the problem. Moreover, a new class of filled functions are constructed, which contains only one parameter. A randomized algorithm is designed to solve the box constrained continuous global minimization problem based on the filled function. Numerical experiments are presented to show the practicability of the algorithm. (c) 2004 Elsevier Inc. All rights reserved.

Keyword:

box constrained continuous global minimization filled function solvability unconstrained continuous global minimization

Community:

  • [ 1 ] Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China

Reprint 's Address:

  • 朱文兴

    [Zhu, WX]Fuzhou Univ, Dept Comp Sci & Technol, Fuzhou 350002, Peoples R China

Show more details

Version:

Related Keywords:

Source :

APPLIED MATHEMATICS AND COMPUTATION

ISSN: 0096-3003

Year: 2005

Issue: 1

Volume: 169

Page: 129-145

0 . 6 8 8

JCR@2005

3 . 5 0 0

JCR@2023

ESI Discipline: MATHEMATICS;

JCR Journal Grade:2

Cited Count:

WoS CC Cited Count: 6

SCOPUS Cited Count: 11

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Online/Total:1152/10964927
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1