An algorithm for minimizing clustering functions

The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is developed which allows one to significantly reduce the computational efforts. This algorithm is based on the so-called discrete gradient method...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 54; no. 4-5; pp. 351 - 368
Main Authors Bagirov, Adil M., Ugon, Julien
Format Journal Article
LanguageEnglish
Published Philadelphia Taylor & Francis Group 01.08.2005
Taylor & Francis LLC
Subjects
2000 Mathematics Subject Classifications: 49M25
Algorithms
Cluster analysis
Clustering functions
Discrete gradient method
Nonsmooth, nonconvex optimization
Optimization algorithms
Studies
Online AccessGet full text
ISSN0233-1934
1029-4945
DOI10.1080/02331930500096155

Cover

Abstract The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is developed which allows one to significantly reduce the computational efforts. This algorithm is based on the so-called discrete gradient method. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed algorithm.
AbstractList The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is developed which allows one to significantly reduce the computational efforts. This algorithm is based on the so-called discrete gradient method. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed algorithm.
The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is developed which allows one to significantly reduce the computational efforts. This algorithm is based on the so-called discrete gradient method. Results of numerical experiments are presented which demonstrate the effectiveness of the proposed algorithm. [PUBLICATION ABSTRACT]
Author Bagirov, Adil M.
Ugon, Julien
Author_xml – sequence: 1
  givenname: Adil M.
  surname: Bagirov
  fullname: Bagirov, Adil M.
  email: a.bagirov@ballarat.edu.au
– sequence: 2
  givenname: Julien
  surname: Ugon
  fullname: Ugon, Julien
BookMark eNqFkEtLAzEUhYNUsK3-AHeD-9Gb10wCbkrxBQU3uh7STKamzCQ1SdH6652hXVnU1b1wz3fP4UzQyHlnELrEcI1BwA0QSrGkwAFAFpjzEzTGQGTOJOMjNB7ueS9gZ2gS4xqA4IKwMYKZy1S78sGmty5rfMg662xnv6xbZbrdxmTCsDZbp5P1Lp6j00a10Vwc5hS93t-9zB_zxfPD03y2yDUtacoVKZhYKgxAS13XTGuuGkypaiQQYUpZCAJlyTWuMV4KXhslKBecNPXSlNTQKbra_90E_741MVVrvw2ut6wIlkxIYKIXlXuRDj7GYJpK26SGnCko21YYqqGd6qidnsQ_yE2wnQq7P5mDm3V9UZ368KGtq6R2rQ9NUE7beExV6TP15O2_JP3d-BsK3owd
CODEN OPTZDQ
CitedBy_id crossref_primary_10_1007_s10589_014_9711_7
crossref_primary_10_1016_j_ejor_2005_04_047
crossref_primary_10_1016_j_patcog_2018_05_028
crossref_primary_10_1016_j_ejor_2017_06_010
crossref_primary_10_1016_j_patcog_2015_11_011
crossref_primary_10_1007_s10898_005_3834_4
crossref_primary_10_1007_s10898_017_0510_4
crossref_primary_10_1007_s10898_014_0171_5
crossref_primary_10_1016_j_cor_2022_106135
crossref_primary_10_1016_j_cageo_2013_06_010
crossref_primary_10_1080_02331934_2014_929681
crossref_primary_10_2139_ssrn_4141620
crossref_primary_10_1016_j_patrec_2014_09_010
crossref_primary_10_1016_j_knosys_2013_11_010
crossref_primary_10_1016_j_compag_2014_10_014
Cites_doi 10.1111/j.1469-1809.1936.tb02137.x
10.1287/opre.17.6.1034
10.1007/BFb0074500
10.1023/A:1023227716953
10.1093/comjnl/7.4.308
10.1007/BF01580381
10.1023/A:1011336210885
10.1007/BF02578945
10.1016/0167-8655(95)00122-0
10.1007/s101070100290
10.1109/T-C.1975.224336
10.1016/0031-3203(92)90088-Z
10.1016/S0031-3203(99)00216-2
10.1016/0377-2217(85)90012-8
10.1142/1493
10.1016/0097-8485(94)85003-8
10.1137/0906020
10.1137/S1064827597328327
10.1145/331499.331504
10.1287/ijoc.3.4.376
10.1137/0315061
10.1016/0031-3203(91)90097-O
10.1080/10556780290027837
10.1016/0031-3203(76)90045-5
10.1016/S0031-3203(02)00060-2
10.1016/0031-3203(95)00022-R
10.1023/A:1020911318981
10.1017/CBO9780511897375
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 2005
Copyright Taylor & Francis Group Aug-Oct 2005
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 2005
– notice: Copyright Taylor & Francis Group Aug-Oct 2005
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
DOI 10.1080/02331930500096155
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Aerospace Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-4945
EndPage 368
ExternalDocumentID 881293971
10_1080_02331930500096155
10054126
Genre Feature
GroupedDBID .7F
.DC
.QJ
0BK
0R~
123
29N
30N
4.4
5VS
AAENE
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
AGDLA
AGMYJ
AGROQ
AHDZW
AHMOU
AIJEM
AJWEG
AKBVH
AKOOK
ALCKM
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMEWO
AQRUH
AVBZW
AWYRJ
BLEHA
CAG
CCCUG
CE4
COF
CRFIH
CS3
DKSSO
DMQIW
DU5
EBS
EJD
E~A
E~B
GTTXZ
H13
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
NA5
O9-
P2P
PQQKQ
QCRFL
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TBQAZ
TDBHL
TEJ
TFL
TFT
TFW
TOXWX
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
07G
1TA
AAGDL
AAHIA
AAIKQ
AAKBW
AAYXX
ACGEE
ADYSH
AEUMN
AFRVT
AGCQS
AGLEN
AIYEW
AMPGV
AMVHM
AMXXU
BCCOT
BPLKW
C06
CITATION
DWIFK
HF~
IVXBP
LJTGL
NUSFT
TAQ
TFMCV
UB9
UU8
V3K
V4Q
7SC
7TB
8FD
FR3
H8D
JQ2
L7M
L~C
L~D
TASJS
ID FETCH-LOGICAL-c373t-a2648ba10037cdd4cc5af133af9028e796820775c1d11b85dea835852fdbe73e3
ISSN 0233-1934
IngestDate Wed Aug 13 04:00:13 EDT 2025
Tue Jul 01 03:52:06 EDT 2025
Thu Apr 24 23:05:46 EDT 2025
Mon May 13 12:09:11 EDT 2019
Wed Dec 25 09:01:49 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 4-5
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c373t-a2648ba10037cdd4cc5af133af9028e796820775c1d11b85dea835852fdbe73e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 219489048
PQPubID 27961
PageCount 18
ParticipantIDs crossref_citationtrail_10_1080_02331930500096155
proquest_journals_219489048
crossref_primary_10_1080_02331930500096155
informaworld_taylorfrancis_310_1080_02331930500096155
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 8/1/2005
2005-08-00
20050801
PublicationDateYYYYMMDD 2005-08-01
PublicationDate_xml – month: 08
  year: 2005
  text: 8/1/2005
  day: 01
PublicationDecade 2000
PublicationPlace Philadelphia
PublicationPlace_xml – name: Philadelphia
PublicationTitle Optimization
PublicationYear 2005
Publisher Taylor & Francis Group
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis Group
– name: Taylor & Francis LLC
References Hansen P (bib22)
Demyanov VF (bib27) 1995
bib14
bib36
bib15
bib12
bib35
Bock HH (bib4) 1998
bib10
Clarke FH (bib26) 1983
bib32
bib11
Makela MM (bib31) 1992
Bagirov AM (bib24)
Hansen P (bib1) 1997; 79
bib28
Bock HH (bib3) 1974
Hiriart-Urruty J-P (bib29) 1993; 1
Reeves CR (bib13) 1993
Nelder JA (bib33) 1965; 7
Houkins DM (bib8) 1982
Bagirov AM (bib25) 2003; 11
Bagirov AM (bib37) 1995; 35
Murphy PM (bib40) 1992
Kiwiel KC (bib30) 1985; 1133
bib23
Reinelt G (bib41) 1991; 3
bib21
bib20
bib9
bib7
Spath H (bib5) 1980
bib18
bib6
bib19
bib16
bib38
bib17
bib39
bib2
Bagirov AM (bib34) 1999
References_xml – ident: bib39
  doi: 10.1111/j.1469-1809.1936.tb02137.x
– volume-title: Automatische Klassifikation
  year: 1974
  ident: bib3
– ident: bib9
  doi: 10.1287/opre.17.6.1034
– volume: 1133
  volume-title: Methods of Descent for Nondifferentiable Optimization
  year: 1985
  ident: bib30
  doi: 10.1007/BFb0074500
– ident: bib36
  doi: 10.1023/A:1023227716953
– volume: 79
  start-page: 191
  year: 1997
  ident: bib1
  publication-title: Mathematical Programming
– volume-title: Optimization and Nonsmooth Analysis
  year: 1983
  ident: bib26
– volume: 7
  start-page: 308
  year: 1965
  ident: bib33
  publication-title: Computer Journal
  doi: 10.1093/comjnl/7.4.308
– ident: bib38
  doi: 10.1007/BF01580381
– volume-title: University of California
  year: 1992
  ident: bib40
– ident: bib20
  doi: 10.1023/A:1011336210885
– volume: 11
  start-page: 1
  year: 2003
  ident: bib25
  publication-title: TOP: Spanish Operations Research Journal
  doi: 10.1007/BF02578945
– volume: 1
  volume-title: Convex Analysis and Minimization Algorithms
  year: 1993
  ident: bib29
– ident: bib18
  doi: 10.1016/0167-8655(95)00122-0
– ident: bib32
  doi: 10.1007/s101070100290
– ident: bib12
  doi: 10.1109/T-C.1975.224336
– ident: bib14
  doi: 10.1016/0031-3203(92)90088-Z
– volume-title: Constructive Nonsmooth Analysis
  year: 1995
  ident: bib27
– ident: bib7
  doi: 10.1016/S0031-3203(99)00216-2
– start-page: pp. 147–175
  volume-title: Progress in Optimization: Contribution from Australasia
  year: 1999
  ident: bib34
– ident: bib11
  doi: 10.1016/0377-2217(85)90012-8
– volume-title: Nonsmooth Optimization
  year: 1992
  ident: bib31
  doi: 10.1142/1493
– ident: bib16
  doi: 10.1016/0097-8485(94)85003-8
– volume-title: Cluster Analysis Algorithms
  year: 1980
  ident: bib5
– ident: bib10
  doi: 10.1137/0906020
– start-page: pp. 265–277
  volume-title: Advances in Data Science and Classification
  year: 1998
  ident: bib4
– volume-title: Journal of Classification
  ident: bib22
– volume: 35
  start-page: 403
  year: 1995
  ident: bib37
  publication-title: Russian Journal of Computational Mathematics and Mathematical Physics
– ident: bib19
  doi: 10.1137/S1064827597328327
– ident: bib2
  doi: 10.1145/331499.331504
– volume: 3
  start-page: 319
  year: 1991
  ident: bib41
  publication-title: ORSA J. Comput.
  doi: 10.1287/ijoc.3.4.376
– volume-title: Modern Heuristic Techniques for Combinatorial Problems
  year: 1993
  ident: bib13
– ident: bib28
  doi: 10.1137/0315061
– ident: bib15
  doi: 10.1016/0031-3203(91)90097-O
– ident: bib35
  doi: 10.1080/10556780290027837
– ident: bib6
  doi: 10.1016/0031-3203(76)90045-5
– ident: bib21
  doi: 10.1016/S0031-3203(02)00060-2
– ident: bib17
  doi: 10.1016/0031-3203(95)00022-R
– ident: bib23
  doi: 10.1023/A:1020911318981
– volume-title: European Journal of Operational Research
  ident: bib24
– volume-title: Topics in Applied Multivariate Analysis
  year: 1982
  ident: bib8
  doi: 10.1017/CBO9780511897375
SSID ssj0021624
Score 1.7511281
Snippet The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization. An algorithm for solving the latter optimization problem is...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 351
SubjectTerms 2000 Mathematics Subject Classifications: 49M25
Algorithms
Cluster analysis
Clustering functions
Discrete gradient method
Nonsmooth, nonconvex optimization
Optimization algorithms
Studies
Title An algorithm for minimizing clustering functions
URI https://www.tandfonline.com/doi/abs/10.1080/02331930500096155
https://www.proquest.com/docview/219489048
Volume 54
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Ja-MwFBalvbSHYbox6YYPPbW4WJZlycfQhVC6XBwaejFe5EwgcUrqDkN__TxtdtKU0OnFGG8P6z29RXrvewid8oJFPg5916Np6QZBQd2IQZSCSS4woVnJ1A7-_UPY6we3AzpoG_-p6pI6u8jfP60r-Q5X4RrwVVbJ_gdnm4_CBTgH_sIROAzHL_G4W52n4-EU4vvfE5UvKIFCJqN3VUg7fpMYCCpREmxXuy5nPNFH0BUTU4TZLmcOR7PpH6UvitG4XSntD6eVraY2tWN2pYA2eWqat_FS046mMbHWNz4hLvhzOr4XWh_K7Jgg0oiPVmFq1GcjGAFQp3MakGj82CXNbFIZgQaQ8FQbBrkl2pohu_X-8Jjc9O_ukvh6EC_eVVaXc-mhRBI2YMNnTG7Nb3R7V89PTZgNkqdAw-zv2L1siaj-kfyCN7KAVbtkm5XDEf9EP0yk4HQ127fRmqh20NYcfuQu8rqV0wiAA191WgFwWgFwGgHYQ_2b6_iy55oWGG5OGKndVCYgZimWMEF5UQR5DlMKE5KWEnVHsCgED44xmuMC44zTQqTgUnPql0UmGBFkH61X00r8Qg4mEDkKn_OQe0EqyjTMKPGjLAQfHXwS0UGeHYokN_jwsk3JOMEWRvbj6HXQWfPKiwZHWfWwNz--Sa3EsdSSuPx4Uv-tO4iueIWsIHVoeZeY6fqagGkOeAQG62Dl3UO02c6dI7Rez97EMfiddXZiBO0f3hZ5pw
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT8IwFH9RPKgHv42IHzt4Mhmu67qPIzESVOAECbel6zol8mFgJIa_3tduIwKGA7cle-269tf-3mtffgV48GMvsIlrmxbjiek4MTMDD6MUQoUklEWJp0_wW2230XXeeqyXb7hN87RKFUMnmVCEXqvV5Fab0UVK3BPyDCIHkao9cGTEXdhj6LcrhFOrvQi4sA1aPgrNTbR3ilPN_6pY4qUl1dK1VVpTT_0YwqLRWcbJV3WWRlUxX9Fz3P6vTuAo90qNWgajU9iRozM4_KNVeA5WbWTwwcd40k8_hwa221CqJMP-HN8aYjBTggvqURGlxvIFdOsvneeGmV-3YArq0dTkKtkt4kRJ0og4doTA4cMQlidK4UV6gYvegucxQWJCIp_FkqP75jM7iSPpUUkvoTQaj-QVGIRilCJt33d9y-Ey4W7EqB1ELvqDyH-yDFbR2aHItcjVlRiDkBSSpaudUYbHRZHvTIhjk7H1dwTDVO9-JNlVJevmYfqTloFtKEI3fKpSoCPMp_80RBpw_AAXx-sta72H_Uan1Qybr-33ChxovViddXgDpXQyk7foCaXRnYb7L6Vk-EE
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3JTsMwELWgSAgO7IhSlhw4IaXEcZzlWAFV2SoOVOotsh0bKrqpTSXUr2fsJFUX1AO3SBk7iT32vImf3iB0EyZB5GLftR3KlO15CbWjALIUTITEhHIVmBP8t6bfaHnPbdrOuTnjnFapc2iVCUWYvVov7mGiCkbcHYQZcBxwVAPAISBuoi0foIlm9BGnOcu34BWMehSY22DvFYeaf3WxEJYWREtXNmkTeer7WXnVsREs1IST7-ok5VUxXZJz_PdHHaC9HJNatcyJDtGG7B-h3TmlwmPk1PoW634ORp30q2fBa1tak6TXmcJdS3QnWm5BX-owaTz5BLXqjx_3DTsvtmALEpDUZprqxhnWgjQiSTwhYPIggWVK67vIIPIBKwQBFTjBmIc0kQzAW0hdlXAZEElOUak_6MszZGECOYp0w9APHY9JxXxOiRtxH9AgRD9ZRk4x1rHIlch1QYxujAvB0uXBKKPbWZNhJsOxztiZn8A4Nf8-VFaoZNU8Tn_SMqJrmpA1j6oUzhHni38cQxDwwgi2xvN_9nqNtt8f6vHrU_OlgnaMWKyhHF6gUjqayEuAQSm_Ms7-C42B9uU
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=An+algorithm+for+minimizing+clustering+functions&rft.jtitle=Optimization&rft.au=Bagirov%2C+Adil+M&rft.au=Ugon%2C+Julien&rft.date=2005-08-01&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0233-1934&rft.eissn=1029-4945&rft.volume=54&rft.issue=4%2C5&rft.spage=351&rft_id=info:doi/10.1080%2F02331930500096155&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=881293971
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