On convergence of "divide the best" global optimization algorithms

In this paper a new class of multidimensional global optimization algorithms (called "divide the best" algorithms) is proposed. The class unifies and generalizes the classes of the characteristic methods and the adaptive partition algorithms introduced by Grishagin and Pinter respectively....

Full description

Saved in:
Bibliographic Details
Published in:Optimization Vol. 44; no. 3; pp. 303 - 325
Main Author: Sergeyev, Yaroslav D.
Format: Journal Article
Language:English
Published: Gordon and Breach Science Publishers 01.01.1998
Subjects:
ISSN:0233-1934, 1029-4945
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper a new class of multidimensional global optimization algorithms (called "divide the best" algorithms) is proposed. The class unifies and generalizes the classes of the characteristic methods and the adaptive partition algorithms introduced by Grishagin and Pinter respectively. The new scheme includes also some methods which do not fit either the characteristic or the adaptive partition families. A detailed convergence study is presented. A special attention is paid to cases where sufficient conditions of everywhere dense, local and global convergence are fulfilled only over subregions of the search domain.
AbstractList In this paper a new class of multidimensional global optimization algorithms (called "divide the best" algorithms) is proposed. The class unifies and generalizes the classes of the characteristic methods and the adaptive partition algorithms introduced by Grishagin and Pinter respectively. The new scheme includes also some methods which do not fit either the characteristic or the adaptive partition families. A detailed convergence study is presented. A special attention is paid to cases where sufficient conditions of everywhere dense, local and global convergence are fulfilled only over subregions of the search domain.
Author Sergeyev, Yaroslav D.
Author_xml – sequence: 1
  givenname: Yaroslav D.
  surname: Sergeyev
  fullname: Sergeyev, Yaroslav D.
  organization: Nizhni Novgorod State University
BookMark eNqN0EtLAzEQB_AgFWyrH8Bb6H118thHwIsWX1DoRc9LNpu0kd2kJKFaP71b9WQRPc1h5jfD_Cdo5LzTCJ0TuCBQwSVQxohgooKq4pwTfoTGBKjIuOD5CI33_WwY4CdoEuMLACUF5WN0s3RYebfVYaWd0tgbPGvt1rYap7XGjY5phledb2SH_SbZ3r7LZL3Dslv5YNO6j6fo2Mgu6rPvOkXPd7dP84dssbx_nF8vMkVzkbK2KUHJnOhGk8bkJa2MAMFUA0azUjZEUV1KCTkHDoy3qlCFMQXosgAiqGFTRL72quBjDNrUm2B7GXY1gXofQn0QwmDKH0bZ9PlACtJ2_5HWGR96-epD19ZJ7jofTJBO2Xio6vSWBnn1p2S_H_4ACt-Hdw
CitedBy_id crossref_primary_10_3390_pr9091624
crossref_primary_10_1007_s10589_015_9741_9
crossref_primary_10_1016_j_cam_2020_113134
crossref_primary_10_1023_A_1012391611462
crossref_primary_10_1016_j_advengsoft_2014_09_014
crossref_primary_10_1007_s10589_017_9955_0
crossref_primary_10_1016_j_cnsns_2014_11_015
crossref_primary_10_1007_s10898_009_9515_y
crossref_primary_10_1007_s11590_017_1228_4
crossref_primary_10_1016_j_cnsns_2014_08_026
crossref_primary_10_1007_s10589_016_9876_3
crossref_primary_10_1007_s11590_021_01726_z
crossref_primary_10_1007_s10589_005_3906_x
crossref_primary_10_1007_s10898_020_00942_8
crossref_primary_10_1016_j_cnsns_2017_11_013
crossref_primary_10_1051_itmconf_20245901019
crossref_primary_10_1134_S0965542510100027
crossref_primary_10_1016_j_conengprac_2025_106495
crossref_primary_10_1007_s10957_016_0947_5
crossref_primary_10_1007_s10898_022_01216_1
crossref_primary_10_1023_A_1014063303984
crossref_primary_10_1023_A_1008719926680
crossref_primary_10_1016_j_amc_2020_125596
crossref_primary_10_1016_j_apnum_2009_10_004
crossref_primary_10_1007_s10898_016_0441_5
crossref_primary_10_1016_j_epsr_2007_10_009
crossref_primary_10_1007_s10898_023_01352_2
crossref_primary_10_1007_s10898_016_0485_6
Cites_doi 10.1016/0167-8191(92)90069-J
10.1007/BF01581266
10.1007/BF02238195
10.1016/0041-5553(72)90115-2
10.1007/BF01580583
10.1007/BF01876141
10.1007/BF01581202
10.1007/978-1-4757-2502-5
10.1007/3-540-50871-6
10.1007/BF02283683
10.1007/978-1-4615-2025-2
10.1007/BF01098365
10.1007/BF00939768
10.1007/BF01580907
10.1007/978-1-4757-2600-8_13
10.1016/0041-5553(89)90002-5
10.1007/BF00939434
10.1007/BF01096533
10.1007/978-3-662-03199-5
10.1023/A:1008242328176
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1998
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1998
DBID AAYXX
CITATION
DOI 10.1080/02331939808844414
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4945
EndPage 325
ExternalDocumentID 10_1080_02331939808844414
8844414
GroupedDBID .7F
.DC
.QJ
0BK
0R~
123
1TA
30N
4.4
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACAGQ
ACGEJ
ACGFS
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALCKM
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMEWO
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CRFIH
CS3
DKSSO
DMQIW
DU5
EBS
EJD
E~A
E~B
GTTXZ
H13
HZ~
H~P
J.P
KYCEM
M4Z
NA5
NUSFT
O9-
P2P
PQQKQ
QCRFL
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TOXWX
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
07G
29N
AAIKQ
AAKBW
AAYXX
ACGEE
ACTCW
AEUMN
AGCQS
AGLEN
AMVHM
AMXXU
BCCOT
BPLKW
C06
CITATION
DWIFK
HF~
IPNFZ
IVXBP
LJTGL
RIG
TAQ
TFMCV
UB9
UU8
V3K
V4Q
ID FETCH-LOGICAL-c259t-db70ca51ebe1bf5728f9093cb0fe37ab1c2e7aa05404034dc6c6ff60e760192f3
IEDL.DBID TFW
ISSN 0233-1934
IngestDate Tue Nov 18 22:37:09 EST 2025
Sat Nov 29 06:01:37 EST 2025
Mon Oct 20 23:41:21 EDT 2025
Mon May 13 12:09:11 EDT 2019
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c259t-db70ca51ebe1bf5728f9093cb0fe37ab1c2e7aa05404034dc6c6ff60e760192f3
PageCount 23
ParticipantIDs crossref_primary_10_1080_02331939808844414
crossref_citationtrail_10_1080_02331939808844414
informaworld_taylorfrancis_310_1080_02331939808844414
PublicationCentury 1900
PublicationDate 1/1/1998
1998-01-00
PublicationDateYYYYMMDD 1998-01-01
PublicationDate_xml – month: 01
  year: 1998
  text: 1/1/1998
  day: 01
PublicationDecade 1990
PublicationTitle Optimization
PublicationYear 1998
Publisher Gordon and Breach Science Publishers
Publisher_xml – name: Gordon and Breach Science Publishers
References Horst R. (CIT0016) 1995
Mladineo R. H. (CIT0022) 1986; 34
Baritompa W. (CIT0002) 1094; 4
Horst R. (CIT0018) 1988; 58
Strongin R. G. (CIT0035) 1978
Pinter J. (CIT0027) 1992; 56
Breiman L. (CIT0004) 1993; 58
Kushner H. A. (CIT0020) 1964; 86
Maclagan D. (CIT0021)
Pinter J. (CIT0026) 1986; 36
Strongin R. G. (CIT0037) 1978
Horst R. (CIT0019) 1996
Hansen P. (CIT0015) 1992
Archetti F. (CIT0001) 1984; 1
Dixon L. C. W. (CIT0005) 1978; 2
Sergeyev Ya. D. (CIT0033) 1997
Fadeyev V. A. (CIT0006)
Floudas C. A. (CIT0007) 1996
Pijavskii S. A. (CIT0024) 1972; 12
Sergeyev Ya. D. (CIT0031) 1994; 5
Gergel V. P. (CIT0008) 1992
Pinter J. (CIT0025) 1983
Strongin R. G. (CIT0036) 1992; 18
Sergeyev Ya. D. (CIT0034) 1990; 29
Horst R. (CIT0017) 1987; 54
Baritompa W. (CIT0003) 1991; 4
Grishagin V.A. (CIT0011); 1983
Hansen P. (CIT0014) 1995
Pardalos P. M. (CIT0023) 1990; 25
Grishagin V. A. . (CIT0010) 1979
Grishagin V.A. (CIT0012) 1991
Grishagin V. A. (CIT0013) 1997; 10
Gorodezkij S.Yu. (CIT0009) 1990
CIT0029
Strongin R. G. (CIT0038) 1992; 18
Torn A. (CIT0039) 1989
CIT0028
Rinnooy Kan A. H. G. (CIT0030) 1989
Sergeyev Ya. D. (CIT0032) 1995; 5
References_xml – volume: 1983
  volume-title: Investigation of a class of numerical methods for solving multiextremal problems
  ident: CIT0011
– volume: 18
  start-page: 1259
  year: 1992
  ident: CIT0036
  publication-title: Parallel Computing
  doi: 10.1016/0167-8191(92)90069-J
– start-page: 83
  year: 1983
  ident: CIT0025
  publication-title: Techn. Report lAMl Ch R
– volume: 58
  start-page: 179
  issue: 3
  year: 1993
  ident: CIT0004
  publication-title: Math .programming
  doi: 10.1007/BF01581266
– volume: 36
  start-page: 91
  year: 1986
  ident: CIT0026
  publication-title: Computing
  doi: 10.1007/BF02238195
– volume: 12
  start-page: 57
  year: 1972
  ident: CIT0024
  publication-title: CSSR Cornput. Math Math. Physics
  doi: 10.1016/0041-5553(72)90115-2
– ident: CIT0029
– volume-title: Klu\ver. Academic Publishers
  year: 1996
  ident: CIT0007
– volume: 34
  start-page: 188
  year: 1986
  ident: CIT0022
  publication-title: Math. Programming.
  doi: 10.1007/BF01580583
– volume: 1
  start-page: 87
  year: 1984
  ident: CIT0001
  publication-title: Annals of Operations Research
  doi: 10.1007/BF01876141
– start-page: 251
  year: 1992
  ident: CIT0015
  publication-title: Muth. Programming.
  doi: 10.1007/BF01581202
– volume: 18
  start-page: 1259
  year: 1992
  ident: CIT0038
  publication-title: Parallel Computing,.
  doi: 10.1016/0167-8191(92)90069-J
– start-page: 82
  volume-title: Numerical methods of nonlinear programming
  year: 1979
  ident: CIT0010
– ident: CIT0028
  doi: 10.1007/978-1-4757-2502-5
– volume-title: Global optimization". Optimization
  year: 1989
  ident: CIT0030
– volume-title: Global optimization
  year: 1989
  ident: CIT0039
  doi: 10.1007/3-540-50871-6
– volume: 5
  year: 1994
  ident: CIT0031
  publication-title: ISI-CNR. Report 11.
– volume: 2
  volume-title: Towards global optimization
  year: 1978
  ident: CIT0005
– volume-title: Systems Department
  year: 1991
  ident: CIT0012
– volume: 25
  year: 1990
  ident: CIT0023
  publication-title: Annals of operations Research
  doi: 10.1007/BF02283683
– volume-title: Handbook of Global Optimization. Kluwer Academic Publishers
  year: 1995
  ident: CIT0016
  doi: 10.1007/978-1-4615-2025-2
– volume-title: Numerical Methods on Multiextremal Problems
  year: 1978
  ident: CIT0037
– volume: 4
  start-page: 329
  issue: 3
  year: 1991
  ident: CIT0003
  publication-title: J. of Global Optimization
  doi: 10.1007/BF01098365
– volume-title: Corky State University.Gork
  year: 1990
  ident: CIT0009
– start-page: 201
  volume-title: State in the Art in Global Optimization.
  ident: CIT0021
– volume: 58
  start-page: 11
  issue: 1
  year: 1988
  ident: CIT0018
  publication-title: JOTA
  doi: 10.1007/BF00939768
– volume: 56
  start-page: 343
  year: 1992
  ident: CIT0027
  publication-title: Math. Programming
  doi: 10.1007/BF01580907
– volume: 5
  start-page: 615
  issue: 4
  year: 1995
  ident: CIT0032
  publication-title: SIAM J. on Optimization
– start-page: 199
  volume-title: Developments in global optimization
  year: 1997
  ident: CIT0033
  doi: 10.1007/978-1-4757-2600-8_13
– volume: 29
  start-page: 7
  issue: 2
  year: 1990
  ident: CIT0034
  publication-title: USSR Conput. Maths. Math. Phys
  doi: 10.1016/0041-5553(89)90002-5
– volume: 86
  start-page: 97
  issue: 1
  year: 1964
  ident: CIT0020
  publication-title: ser. D..
– start-page: 161
  volume-title: System Dynamics and Optimization
  year: 1992
  ident: CIT0008
– volume-title: Handbook of Global Optimization
  year: 1995
  ident: CIT0014
– volume: 54
  start-page: 53
  issue: 2
  year: 1987
  ident: CIT0017
  publication-title: JOTA
  doi: 10.1007/BF00939434
– start-page: 25
  volume-title: Pro., of the 3rd ,NII P.MK Conf. of Young Scientists. Dep. VINlTI 5835-84
  ident: CIT0006
– volume: 4
  start-page: 37
  issue: 1
  year: 1094
  ident: CIT0002
  publication-title: J. of Globa1 Optimization
  doi: 10.1007/BF01096533
– volume-title: Numerical Methods on Multiextremal Problems
  year: 1978
  ident: CIT0035
– volume-title: Global Optimization - Deterministic Approaches
  year: 1996
  ident: CIT0019
  doi: 10.1007/978-3-662-03199-5
– volume: 10
  start-page: 185
  year: 1997
  ident: CIT0013
  publication-title: J. of Global Optimization
  doi: 10.1023/A:1008242328176
SSID ssj0021624
Score 1.5859698
Snippet In this paper a new class of multidimensional global optimization algorithms (called "divide the best" algorithms) is proposed. The class unifies and...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 303
SubjectTerms convergence
Global optimization
Mathematics Subject Classification 1991
numerical algorithms
Primary: 90C30
Secondary: 49M37
Title On convergence of "divide the best" global optimization algorithms
URI https://www.tandfonline.com/doi/abs/10.1080/02331939808844414
Volume 44
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1029-4945
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021624
  issn: 0233-1934
  databaseCode: TFW
  dateStart: 19850101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI4Q4gAH3ojxUjRxQqpImj6SIyAmToPDELtVTRrDpK1Fa0H8fJK0nTYeO8DdbqvEju3U_j6EzilQHtkGByECU6DoTHmCKO2FIRfKB6ElB0c2Eff7fDgUD01vTtm0VdoaGmqgCHdWW-dOZdl2xF2aMGMMhwluPCQIahprE_atWw56T7Nyi0aO0tZKe0Y8aP9p_vSEhai0gFk6F216W__8zm202aSZ-Kq2ix20ovNdtDEHPriHru9z7HrO3filxgXgrhvO0tgkhViacNHFNV4ILszBMmkmNnE6fi6mo-plUu6jx97t4ObOaxgVPGXKnMrLZExUGlKzc1RCGPscBBFMSQKaxamkytdxmto0LiAsyFSkIoCIaNs5I3xgB2g1L3J9iDCkNAiBUAVZFjDOJWQxEVyxDDLNQtlBpF3RRDVw45b1YpzQFpX06_J00MVM5bXG2lgmTOa3KancBQfUbCTfxZPqo-qgcIkK-_VVR3_UO0br9QSjvbA5QavV9E2fojX1Xo3K6Zkz1k9OwOV9
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELVQQQIO7IiyWhUnpAg7zmIfAVEVUQqHInqLEscDldoUtQHx-dhOWrUsPcB9JonssWfJzHsInVKgPDANDkJ4OkFRqXQEkcrxfS6kC0IlHCzZRNhq8U5HPJQFt1HZVmlyaCiAIuxdbQ63KUaPW-LOtZ_RlsME10fE8yyP9aKv_azBzm_XnyYJFw0sqa0Rd7S8N_6r-dMjZvzSDGrplL-pr__3SzfQWhlp4ovCNDbRgsq20OoU_uA2urzPsG07txOYCg8A1-x8lsI6LsSJ9hg1XECG4IG-W_rl0CaOe8-DYTd_6Y920GP9un3VcEpSBUfqTCd30iQkMvap3jyagB-6HAQRTCYEFAvjhEpXhXFsIjmPMC-VgQwAAqJM84xwge2iSjbI1B7CEFPPB0IlpKnHOE8gDYngkqWQKuYnVUTGSxrJEnHcEF_0IjoGJv26PFV0NlF5LeA25gmT6X2KclvjgIKQ5Lt4lH_kVeTPUWG_vmr_j3onaLnRvmtGzZvW7QFaKQYaTf3mEFXy4Zs6QkvyPe-OhsfWcj8B5Ibppw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELVQQQgO7IiyWhUnpAi7zmIf2SoQqPRQRG9RYnugUje1AfH52E5atSw9wH2cRPbYM-O8eQ-hUwqUhxbgIIRvChStpCeI1F4QcCGrIHTKwYlNRPU6b7VEo8DmjApYpa2hISeKcGe13dwDBWNE3LkJM8ZxmOBmh_i-k7FeNGlzaB28WXue1Fs0dJq21twz9v74p-ZPj5gJSzOkpVPhprb-zw_dQGtFnokvcsfYRAu6t4VWp9gHt9HlYw870Lnrv9S4D7jiurM0NlkhTk28qOCcMAT3zcnSLVo2cdJ56Q_b2Wt3tIOeajfNq1uvkFTwpKlzMk-lEZFJQM3S0RSCqMpBEMFkSkCzKEmprOooSWwe5xPmKxnKECAk2kJnRBXYLir1-j29hzAk1A-AUAlK-YzzFFREBJdMgdIsSMuIjGc0lgXfuJW96MR0TEv6dXrK6GwyZJCTbcwzJtPLFGfuhgNyOZLv5nH2kZVRMGcI-_VV-38cd4KWG9e1-OGufn-AVvJuRnt5c4hK2fBNH6El-Z61R8Nj57efMLToWQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+convergence+of+%22divide+the+best%22+global+optimization+algorithms&rft.jtitle=Optimization&rft.au=Sergeyev%2C+Yaroslav+D.&rft.date=1998-01-01&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=44&rft.issue=3&rft.spage=303&rft.epage=325&rft_id=info:doi/10.1080%2F02331939808844414&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_02331939808844414
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0233-1934&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0233-1934&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0233-1934&client=summon