A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems

We consider the constrained multi-objective optimization problem of finding Pareto critical points of difference of convex functions. The new approach proposed by Bento et al. (SIAM J Optim 28:1104–1120, 2018) to study the convergence of the proximal point method is applied. Our method minimizes at...

Full description

Saved in:
Bibliographic Details
Published in:Computational optimization and applications Vol. 75; no. 1; pp. 263 - 290
Main Authors: de Carvalho Bento, Glaydston, Bitar, Sandro Dimy Barbosa, da Cruz Neto, João Xavier, Soubeyran, Antoine, de Oliveira Souza, João Carlos
Format: Journal Article
Language:English
Published: New York Springer US 01.01.2020
Springer Nature B.V
Springer Verlag
Subjects:
ISSN:0926-6003, 1573-2894
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We consider the constrained multi-objective optimization problem of finding Pareto critical points of difference of convex functions. The new approach proposed by Bento et al. (SIAM J Optim 28:1104–1120, 2018) to study the convergence of the proximal point method is applied. Our method minimizes at each iteration a convex approximation instead of the (non-convex) objective function constrained to a possibly non-convex set which assures the vector improving process. The motivation comes from the famous Group Dynamic problem in Behavioral Sciences where, at each step, a group of (possible badly informed) agents tries to increase his joint payoff, in order to be able to increase the payoff of each of them. In this way, at each step, this ascent process guarantees the stability of the group. Some encouraging preliminary numerical results are reported.
AbstractList We consider the constrained multi-objective optimization problem of finding Pareto critical points of difference of convex functions. The new approach proposed by Bento et al. (SIAM J Optim 28:1104–1120, 2018) to study the convergence of the proximal point method is applied. Our method minimizes at each iteration a convex approximation instead of the (non-convex) objective function constrained to a possibly non-convex set which assures the vector improving process. The motivation comes from the famous Group Dynamic problem in Behavioral Sciences where, at each step, a group of (possible badly informed) agents tries to increase his joint payoff, in order to be able to increase the payoff of each of them. In this way, at each step, this ascent process guarantees the stability of the group. Some encouraging preliminary numerical results are reported.
Author Bitar, Sandro Dimy Barbosa
de Oliveira Souza, João Carlos
Soubeyran, Antoine
da Cruz Neto, João Xavier
de Carvalho Bento, Glaydston
Author_xml – sequence: 1
  givenname: Glaydston
  surname: de Carvalho Bento
  fullname: de Carvalho Bento, Glaydston
  organization: IME, Federal University of Goiás
– sequence: 2
  givenname: Sandro Dimy Barbosa
  surname: Bitar
  fullname: Bitar, Sandro Dimy Barbosa
  organization: ICE, Federal University of Amazonas
– sequence: 3
  givenname: João Xavier
  surname: da Cruz Neto
  fullname: da Cruz Neto, João Xavier
  organization: CCN, DM, Federal University of Piauí
– sequence: 4
  givenname: Antoine
  surname: Soubeyran
  fullname: Soubeyran, Antoine
  organization: CNRS and EHESS, Aix-Marseille University (Aix-Marseille School of Economics)
– sequence: 5
  givenname: João Carlos
  orcidid: 0000-0003-4053-8211
  surname: de Oliveira Souza
  fullname: de Oliveira Souza, João Carlos
  email: joaocos.mat@ufpi.edu.br
  organization: CCN, DM, Federal University of Piauí
BackLink https://amu.hal.science/hal-02351104$$DView record in HAL
BookMark eNp9UU1v3CAQRVUqdZP2D_SElFMObgewF3NcRUlTaaVc2jPCGLKsbHABbz7u-d9l46qRcsgBRnp6b-bNvFN04oM3CH0l8I0A8O-JQNOKCkh5QFj5P6AVaTiraCvqE7QCQdfVGoB9Qqcp7QFAcEZX6HmDpxge3KgGPAXnMx5N3oUe2xBx76w10XhtcLBYB38wD9jOXmcXfMLO43EesqtCtzcFOxTalN3ontSRgO9d3mE1TYPTC5ADvothnnD_6NXo9HF0N5gxfUYfrRqS-fKvnqHf11e_Lm-q7e2Pn5ebbaWZ4Lmy3NZtp3tTqu2NrUHRWjeCt6JRtm110yvKVKNt33XcqtY0lPeCaqoEq8s1ztDF0nenBjnFsnV8lEE5ebPZyiMGlDWEQH0ghXu-cIvJP7NJWe7DHH2xJyljFGANnBUWXVg6hpSisf_bEpDHaOQSjSzRyJdoJBRR-0akXX45UY7KDe9L2SJNZY6_M_HV1Tuqv6EJqF8
CitedBy_id crossref_primary_10_1016_j_heliyon_2024_e39498
crossref_primary_10_1515_jaa_2021_2074
crossref_primary_10_1016_j_cie_2021_107389
crossref_primary_10_1007_s11075_025_02177_8
crossref_primary_10_1137_20M1353368
crossref_primary_10_3390_math10111787
crossref_primary_10_1007_s11117_024_01057_0
crossref_primary_10_1007_s10479_021_04175_0
Cites_doi 10.1016/j.cam.2004.06.018
10.1016/0022-247X(92)90336-C
10.1016/j.ejor.2015.06.016
10.1007/s10957-013-0327-3
10.1007/s11228-014-0279-2
10.1080/02331934.2010.522710
10.1177/001872674700100103
10.1016/j.ejor.2014.01.022
10.1007/s10898-015-0367-3
10.1080/02331931003770411
10.1137/S1052623403429093
10.1007/978-3-540-24828-6
10.4064/ap87-0-2
10.1007/BF00935364
10.1007/s10957-015-0711-2
10.1137/060655183
10.1007/s10898-014-0159-1
10.1007/s11228-015-0319-6
10.1137/S1052623494274313
10.1023/B:COAP.0000018877.86161.8b
10.1137/08071692X
10.1007/3-540-31246-3
10.1007/s10957-010-9667-4
10.1590/0101-7438.2014.034.03.0585
10.1007/BF01580762
10.1007/978-3-319-92775-6
10.1090/S0002-9947-1975-0367131-6
10.1007/s10898-015-0282-7
10.1007/s10957-015-0847-0
10.2140/pjm.1959.9.707
10.1016/j.ejor.2014.01.002
10.1007/s10898-009-9486-z
10.1007/s10589-012-9494-7
10.1137/0314056
10.1016/j.ejor.2011.05.006
10.1007/s101070050050
10.1016/0022-247X(82)90226-8
10.1016/0377-2217(80)90142-3
10.1080/02331934.2011.564623
10.1007/978-3-642-45610-7_3
10.1007/3-540-31247-1
10.1023/B:JOTA.0000012735.86699.a1
10.1016/j.ejor.2006.09.070
10.1080/02331930903500282
10.24033/bsmf.1625
10.1137/120866415
10.1137/16M107534X
10.1023/A:1017535424813
10.1007/s10589-017-9954-1
10.1016/j.ejor.2016.05.026
10.1137/1.9781611971309
10.1093/oso/9780195135008.001.0001
10.1007/s10479-018-3104-8
10.1016/S0304-0208(08)72402-2
ContentType Journal Article
Copyright Springer Science+Business Media, LLC, part of Springer Nature 2019
Computational Optimization and Applications is a copyright of Springer, (2019). All Rights Reserved.
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Springer Science+Business Media, LLC, part of Springer Nature 2019
– notice: Computational Optimization and Applications is a copyright of Springer, (2019). All Rights Reserved.
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L6V
L7M
L~C
L~D
M0C
M0N
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
1XC
BXJBU
IHQJB
VOOES
DOI 10.1007/s10589-019-00139-0
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Health Research Premium Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global (OCUL)
Computing Database
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
ProQuest Central Basic
Hyper Article en Ligne (HAL)
HAL-SHS: Archive ouverte en Sciences de l'Homme et de la Société
HAL-SHS: Archive ouverte en Sciences de l'Homme et de la Société (Open Access)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ProQuest Central Korea
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList
ProQuest Business Collection (Alumni Edition)

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Statistics
Mathematics
EISSN 1573-2894
EndPage 290
ExternalDocumentID oai:HAL:hal-02351104v1
10_1007_s10589_019_00139_0
GrantInformation_xml – fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico
  grantid: 458479/2014-4; 471815/2012-8
  funderid: http://dx.doi.org/10.13039/501100003593
– fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico (BR)
  grantid: 305462/2014-8
– fundername: Fundação de Amparo à Pesquisa do Estado de Goiás
  grantid: 201210267000909 - 05/2012
  funderid: http://dx.doi.org/10.13039/501100005285
– fundername: Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
  grantid: 88881.117595/2016-01
  funderid: http://dx.doi.org/10.13039/501100002322
– fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico
  grantid: 424169/2018-5
  funderid: http://dx.doi.org/10.13039/501100003593
– fundername: Conselho Nacional de Desenvolvimento Científico e Tecnológico
  grantid: 312077/2014-9
  funderid: http://dx.doi.org/10.13039/501100003593
GroupedDBID -52
-5D
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
28-
29F
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
7WY
88I
8AO
8FE
8FG
8FL
8FW
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHQJS
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EBU
EDO
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9R
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZD
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z7R
Z7S
Z7X
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8R
Z8U
Z8W
Z92
ZL0
ZMTXR
ZWQNP
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
1XC
BXJBU
IHQJB
VOOES
ID FETCH-LOGICAL-c397t-f7f48bcde7f4fdef40a24c597895af88c5da23a5cfdbb7fa8e527d92c2a934573
IEDL.DBID M2P
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000490228000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0926-6003
IngestDate Sat Nov 29 14:58:03 EST 2025
Wed Nov 26 14:42:17 EST 2025
Tue Nov 18 22:36:15 EST 2025
Sat Nov 29 01:51:29 EST 2025
Fri Feb 21 02:36:45 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Multi-objective programming
Behavioral sciences
Proximal point method
DC function
Variational rationality
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c397t-f7f48bcde7f4fdef40a24c597895af88c5da23a5cfdbb7fa8e527d92c2a934573
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-4053-8211
OpenAccessLink https://amu.hal.science/hal-02351104
PQID 2332006073
PQPubID 30811
PageCount 28
ParticipantIDs hal_primary_oai_HAL_hal_02351104v1
proquest_journals_2332006073
crossref_primary_10_1007_s10589_019_00139_0
crossref_citationtrail_10_1007_s10589_019_00139_0
springer_journals_10_1007_s10589_019_00139_0
PublicationCentury 2000
PublicationDate 20200100
2020-01-00
20200101
2020-01
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 1
  year: 2020
  text: 20200100
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationSubtitle An International Journal
PublicationTitle Computational optimization and applications
PublicationTitleAbbrev Comput Optim Appl
PublicationYear 2020
Publisher Springer US
Springer Nature B.V
Springer Verlag
Publisher_xml – name: Springer US
– name: Springer Nature B.V
– name: Springer Verlag
References Holmberg, Tuy (CR31) 1999; 85
Bento, Soubeyran (CR7) 2015; 166
Bento, Cruz Neto, Oliveira, Soubeyran (CR6) 2014; 235
Ji, Goh, De Souza (CR34) 2016; 169
Thibault (CR64) 1982; 86
Bello Cruz (CR3) 2013; 23
Dinh, Strodiot, Nguyen (CR20) 2010; 48
Hartman (CR29) 1959; 9
Apolinário, Papa Quiroz, Oliveira (CR1) 2016; 64
Burke, Ferris, Qian (CR12) 1992; 166
Martinet (CR40) 1970; 4
Bento, Cruz Neto, López, Soubeyran, Souza (CR4) 2018; 28
Jahn (CR33) 2004
Souza, Oliveira (CR60) 2015; 63
Tuy, Horst (CR65) 1988; 41
Flores-Bazán, Oettli (CR23) 2001; 108
Qu, Liu, Goh, Li, Ji (CR51) 2014; 235
Bento, Cruz Neto, Soubeyran (CR5) 2014; 22
Graña Drummond, Iusem (CR26) 2004; 28
Ceng, Mordukhovich, Yao (CR14) 2010; 146
Minami (CR42) 1983; 41
Muu, Quoc (CR49) 2010; 59
Lewin (CR36) 1964
Guo, Li (CR28) 2014; 162
Fukuda, Graña Drummond (CR25) 2014; 34
Fukuda, Graña Drummond (CR24) 2011; 60
Bolte, Danilidis, Lewis, Shiota (CR9) 2005; 87
Brito, Cruz Neto, Santos, Souza (CR11) 2017; 256
Miettinen (CR41) 1999
Huang, Yang (CR32) 2004; 120
Rockafellar (CR53) 1976; 14
Villacorta, Oliveira (CR66) 2011; 214
Graña Drummond, Svaiter (CR27) 2005; 175
CR18
Bento, Soubeyran (CR8) 2015; 23
CR59
Mordukhovich (CR47) 2006
CR58
Fliege, Graña Drummond, Svaiter (CR22) 2009; 20
CR57
CR56
Hiriart-Urruty (CR30) 1986; 256
CR55
Cruz Neto, Silva, Ferreira, Lopes (CR19) 2013; 54
Lewin (CR35) 1947; 1
Bačák, Borwein (CR2) 2011; 60
Mai, Luu (CR39) 2018; 2
Ceng, Yao (CR13) 2007; 183
Clarke (CR16) 1975; 205
Moreno, Oliveira, Soubeyran (CR44) 2012; 61
Ferrer, Bagirov, Beliakov (CR21) 2015; 61
Luc, Tan, Tinh (CR37) 1998; 23
Qu, Goh, Ji, De Souza (CR52) 2015; 247
Wen, Chen, Pong (CR67) 2018; 69
Bonnel, Iusem, Svaiter (CR10) 2005; 15
Ross, Soland (CR54) 1980; 4
Clarke (CR17) 1990
Sun, Sampaio, Candido (CR61) 2003; 21
Mordukhovich (CR46) 2006
Choung, Mordukhovich, Yao (CR15) 2011; 12
CR62
Tao, An (CR63) 1998; 8
Moreau (CR43) 1965; 93
Mordukhovich (CR48) 2018
Poole, Van de Ven (CR50) 2004
Luc (CR38) 1989
Maingé, Moudafi (CR45) 2008; 19
XL Guo (139_CR28) 2014; 162
H Tuy (139_CR65) 1988; 41
DT Luc (139_CR38) 1989
BS Mordukhovich (139_CR48) 2018
HCF Apolinário (139_CR1) 2016; 64
LC Ceng (139_CR13) 2007; 183
K Lewin (139_CR35) 1947; 1
JB Hiriart-Urruty (139_CR30) 1986; 256
Y Ji (139_CR34) 2016; 169
J Fliege (139_CR22) 2009; 20
TD Choung (139_CR15) 2011; 12
GC Bento (139_CR7) 2015; 166
JX Cruz Neto (139_CR19) 2013; 54
GC Bento (139_CR4) 2018; 28
H Bonnel (139_CR10) 2005; 15
KDV Villacorta (139_CR66) 2011; 214
BS Mordukhovich (139_CR47) 2006
F Flores-Bazán (139_CR23) 2001; 108
P-E Maingé (139_CR45) 2008; 19
S Qu (139_CR52) 2015; 247
K Holmberg (139_CR31) 1999; 85
FG Moreno (139_CR44) 2012; 61
LD Muu (139_CR49) 2010; 59
139_CR55
TT Mai (139_CR39) 2018; 2
LM Graña Drummond (139_CR26) 2004; 28
M Bačák (139_CR2) 2011; 60
139_CR18
MS Poole (139_CR50) 2004
AS Brito (139_CR11) 2017; 256
GC Bento (139_CR6) 2014; 235
EH Fukuda (139_CR25) 2014; 34
139_CR58
139_CR59
139_CR56
139_CR57
RT Rockafellar (139_CR53) 1976; 14
W Sun (139_CR61) 2003; 21
EH Fukuda (139_CR24) 2011; 60
XX Huang (139_CR32) 2004; 120
DT Luc (139_CR37) 1998; 23
139_CR62
N Dinh (139_CR20) 2010; 48
P Hartman (139_CR29) 1959; 9
J Jahn (139_CR33) 2004
S Qu (139_CR51) 2014; 235
LM Graña Drummond (139_CR27) 2005; 175
PD Tao (139_CR63) 1998; 8
A Ferrer (139_CR21) 2015; 61
GT Ross (139_CR54) 1980; 4
M Minami (139_CR42) 1983; 41
JY Bello Cruz (139_CR3) 2013; 23
JJ Moreau (139_CR43) 1965; 93
JV Burke (139_CR12) 1992; 166
FH Clarke (139_CR16) 1975; 205
FH Clarke (139_CR17) 1990
B Martinet (139_CR40) 1970; 4
GC Bento (139_CR8) 2015; 23
JCO Souza (139_CR60) 2015; 63
B Wen (139_CR67) 2018; 69
K Lewin (139_CR36) 1964
KM Miettinen (139_CR41) 1999
GC Bento (139_CR5) 2014; 22
LC Ceng (139_CR14) 2010; 146
BS Mordukhovich (139_CR46) 2006
J Bolte (139_CR9) 2005; 87
L Thibault (139_CR64) 1982; 86
References_xml – volume: 175
  start-page: 395
  year: 2005
  end-page: 414
  ident: CR27
  article-title: A steepest descent method for vector optimization
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2004.06.018
– volume: 166
  start-page: 199
  year: 1992
  end-page: 213
  ident: CR12
  article-title: On the Clarke subdifferential of the distance function of a closed set
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(92)90336-C
– volume: 247
  start-page: 359
  year: 2015
  end-page: 365
  ident: CR52
  article-title: A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.06.016
– volume: 12
  start-page: 257
  year: 2011
  end-page: 286
  ident: CR15
  article-title: Hybrid approximate proximal algorithms for efficient solutions in vector optimization
  publication-title: J. Nonlinear Convex Anal.
– volume: 162
  start-page: 821
  year: 2014
  end-page: 844
  ident: CR28
  article-title: Optimality conditions for vector optimization problems with difference of convex maps
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-013-0327-3
– volume: 22
  start-page: 557
  year: 2014
  end-page: 573
  ident: CR5
  article-title: A proximal point-type method for multicriteria optimization
  publication-title: Set-Valued Var. Anal.
  doi: 10.1007/s11228-014-0279-2
– volume: 60
  start-page: 1009
  year: 2011
  end-page: 1021
  ident: CR24
  article-title: On the convergence of the projected gradient method for vector optimization
  publication-title: Optimization
  doi: 10.1080/02331934.2010.522710
– volume: 1
  start-page: 5
  year: 1947
  end-page: 41
  ident: CR35
  article-title: Frontiers in group dynamics: concept, method and reality in social science; social equilibria and social change
  publication-title: Hum. Relat.
  doi: 10.1177/001872674700100103
– volume: 235
  start-page: 503
  year: 2014
  end-page: 510
  ident: CR51
  article-title: Nonsmooth multiobjective programming with quasi-Newton methods
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2014.01.022
– volume: 64
  start-page: 79
  year: 2016
  end-page: 96
  ident: CR1
  article-title: A scalarization proximal point method for quasiconvex multiobjective minimization
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0367-3
– volume: 60
  start-page: 961
  year: 2011
  end-page: 978
  ident: CR2
  article-title: On difference convexity of locally Lipschitz functions
  publication-title: Optimization
  doi: 10.1080/02331931003770411
– volume: 15
  start-page: 953
  year: 2005
  end-page: 970
  ident: CR10
  article-title: Proximal methods in vector optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403429093
– year: 2004
  ident: CR33
  publication-title: Vector Optimization: Theory, Applications and Extensions
  doi: 10.1007/978-3-540-24828-6
– volume: 87
  start-page: 13
  year: 2005
  end-page: 25
  ident: CR9
  article-title: Clarke critical values of subanalytic Lipschitz continuous functions
  publication-title: Ann. Polon. Math.
  doi: 10.4064/ap87-0-2
– volume: 41
  start-page: 451
  year: 1983
  end-page: 461
  ident: CR42
  article-title: Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00935364
– volume: 166
  start-page: 172
  year: 2015
  end-page: 187
  ident: CR7
  article-title: Generalized inexact proximal algorithms: routine’s formation with resistance to change, following worthwhile changes
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0711-2
– volume: 19
  start-page: 397
  year: 2008
  end-page: 413
  ident: CR45
  article-title: Convergence of new inertial proximal methods for DC programming
  publication-title: SIAM J. Optim.
  doi: 10.1137/060655183
– volume: 61
  start-page: 71
  year: 2015
  end-page: 89
  ident: CR21
  article-title: Solving DC programs using the cutting angle method
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-014-0159-1
– volume: 23
  start-page: 501
  year: 2015
  end-page: 517
  ident: CR8
  article-title: A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka–Łojasiewicz inequality
  publication-title: Set-Valued Var. Anal.
  doi: 10.1007/s11228-015-0319-6
– volume: 8
  start-page: 476
  year: 1998
  end-page: 505
  ident: CR63
  article-title: A DC optimization algorithm for solving the trust region subproblem
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623494274313
– volume: 28
  start-page: 5
  year: 2004
  end-page: 29
  ident: CR26
  article-title: A projected gradient method for vector optimization problems
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/B:COAP.0000018877.86161.8b
– ident: CR58
– volume: 20
  start-page: 602
  issue: 2
  year: 2009
  end-page: 626
  ident: CR22
  article-title: Newton’s method for multiobjective optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/08071692X
– year: 2006
  ident: CR47
  publication-title: Variational Analysis and Generalized Differentiation. II. Applications, Grundlehren der Mathematischen Wissenschaften
  doi: 10.1007/3-540-31246-3
– volume: 146
  start-page: 267
  year: 2010
  end-page: 303
  ident: CR14
  article-title: Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-010-9667-4
– volume: 34
  start-page: 585
  year: 2014
  end-page: 620
  ident: CR25
  article-title: A survey on multiobjective descent methods
  publication-title: Pesqui. Oper.
  doi: 10.1590/0101-7438.2014.034.03.0585
– volume: 41
  start-page: 161
  year: 1988
  end-page: 183
  ident: CR65
  article-title: Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and dc optimization problems
  publication-title: Math. Program.
  doi: 10.1007/BF01580762
– year: 2018
  ident: CR48
  publication-title: Variational Analysis and Applications
  doi: 10.1007/978-3-319-92775-6
– volume: 205
  start-page: 247
  year: 1975
  end-page: 262
  ident: CR16
  article-title: Generalized gradients and applications
  publication-title: Trans. Am. Math. Soc.
  doi: 10.1090/S0002-9947-1975-0367131-6
– volume: 63
  start-page: 797
  year: 2015
  end-page: 810
  ident: CR60
  article-title: A proximal point algorithm for DC functions on Hadamard manifolds
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0282-7
– volume: 169
  start-page: 280
  year: 2016
  end-page: 289
  ident: CR34
  article-title: Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0847-0
– volume: 9
  start-page: 707
  year: 1959
  end-page: 713
  ident: CR29
  article-title: On functions representable as a difference of convex functions
  publication-title: Pac. J. Math.
  doi: 10.2140/pjm.1959.9.707
– ident: CR57
– volume: 235
  start-page: 494
  year: 2014
  end-page: 502
  ident: CR6
  article-title: The self regulation problem as an inexact steepest descent method for multicriteria optimization
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2014.01.002
– volume: 23
  start-page: 107
  year: 1998
  end-page: 127
  ident: CR37
  article-title: Convex vector functions and their subdifferential
  publication-title: Acta Math. Vietnam
– volume: 48
  start-page: 183
  year: 2010
  end-page: 208
  ident: CR20
  article-title: Duality and optimality conditions for generalized equilibrium problems involving DC functions
  publication-title: Glob. Optim.
  doi: 10.1007/s10898-009-9486-z
– ident: CR18
– year: 2004
  ident: CR50
  publication-title: Handbook of Organizational Change and Innovation
– volume: 54
  start-page: 461
  year: 2013
  end-page: 472
  ident: CR19
  article-title: A subgradient method for multiobjective optimization
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-012-9494-7
– volume: 14
  start-page: 877
  year: 1976
  end-page: 898
  ident: CR53
  article-title: Monotone operators and the proximal point algorithm
  publication-title: SIAM J. Control. Optim.
  doi: 10.1137/0314056
– year: 1989
  ident: CR38
  publication-title: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems
– year: 1964
  ident: CR36
  publication-title: Field Theory in Social Science. Harper Torchbooks
– year: 1999
  ident: CR41
  publication-title: Nonlinear Multiobjective Optimization
– volume: 214
  start-page: 485
  year: 2011
  end-page: 492
  ident: CR66
  article-title: An interior proximal method in vector optimization
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.05.006
– volume: 85
  start-page: 157
  year: 1999
  end-page: 179
  ident: CR31
  article-title: A production–transportation problem with stochastic demand and concave production costs
  publication-title: Math. Program.
  doi: 10.1007/s101070050050
– volume: 21
  start-page: 451
  year: 2003
  end-page: 462
  ident: CR61
  article-title: Proximal point algorithm for minimization of DC Functions
  publication-title: J. Comput. Math.
– ident: CR56
– volume: 86
  start-page: 319
  year: 1982
  end-page: 344
  ident: CR64
  article-title: Subdifferentials of nonconvex vector-valued functions
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(82)90226-8
– volume: 4
  start-page: 307
  year: 1980
  end-page: 321
  ident: CR54
  article-title: A multicriteria approach to the location of public facilities
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(80)90142-3
– volume: 61
  start-page: 1383
  year: 2012
  end-page: 1403
  ident: CR44
  article-title: A proximal point algorithm with quasi distance. Application to habit’s formation
  publication-title: Optimization
  doi: 10.1080/02331934.2011.564623
– volume: 256
  start-page: 37
  year: 1986
  end-page: 70
  ident: CR30
  article-title: Generalized differentiabity, duality and optimization for problems dealing with difference of convex functions
  publication-title: Convex. Dual. Optim. Lect. Notes Econ. Math. Syst.
  doi: 10.1007/978-3-642-45610-7_3
– year: 2006
  ident: CR46
  publication-title: Variational Analysis and Generalized Differentiation. I. Basic Theory, Grundlehren der Mathematischen Wissenschaften
  doi: 10.1007/3-540-31247-1
– volume: 120
  start-page: 111
  year: 2004
  end-page: 127
  ident: CR32
  article-title: Duality for multiobjective optimization via nonlinear Lagrangian functions
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/B:JOTA.0000012735.86699.a1
– volume: 183
  start-page: 1
  year: 2007
  end-page: 19
  ident: CR13
  article-title: Approximate proximal methods in vector optimization
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2006.09.070
– volume: 59
  start-page: 63
  year: 2010
  end-page: 76
  ident: CR49
  article-title: One step from DC optimization to DC mixed variational inequalities
  publication-title: Optimization
  doi: 10.1080/02331930903500282
– volume: 93
  start-page: 273
  year: 1965
  end-page: 299
  ident: CR43
  article-title: Proximité et dualité dans un espace Hilbertien
  publication-title: Bull. Soc. Math. Fr.
  doi: 10.24033/bsmf.1625
– volume: 23
  start-page: 2169
  year: 2013
  end-page: 2182
  ident: CR3
  article-title: A subgradient method for vector optimization problems
  publication-title: SIAM J. Optim.
  doi: 10.1137/120866415
– volume: 28
  start-page: 1104
  issue: 2
  year: 2018
  end-page: 1120
  ident: CR4
  article-title: The proximal point method for locally Lipschitz functions in multiobjective optimization with application to the compromise problem
  publication-title: SIAM J. Optim.
  doi: 10.1137/16M107534X
– volume: 108
  start-page: 571
  year: 2001
  end-page: 586
  ident: CR23
  article-title: Simplified optimality conditions for minimizing the difference of vector-valued functions
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1017535424813
– volume: 69
  start-page: 297
  year: 2018
  end-page: 324
  ident: CR67
  article-title: A proximal difference-of-convex algorithm with extrapolation
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-017-9954-1
– volume: 256
  start-page: 17
  year: 2017
  end-page: 23
  ident: CR11
  article-title: A relaxed projection method for solving multiobjective optimization problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2016.05.026
– volume: 2
  start-page: 379
  year: 2018
  end-page: 389
  ident: CR39
  article-title: Optimality conditions for weakly efficient solutions of vector variational inequalities via convexificators
  publication-title: J. Nonlinear Var. Anal.
– year: 1990
  ident: CR17
  publication-title: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics
  doi: 10.1137/1.9781611971309
– ident: CR55
– ident: CR59
– ident: CR62
– volume: 4
  start-page: 154
  year: 1970
  end-page: 159
  ident: CR40
  article-title: Regularisation d’inéquations variationelles par approximations succesives
  publication-title: Rev. Francaise d’Inform. Recherche Oper.
– ident: 139_CR58
– volume: 214
  start-page: 485
  year: 2011
  ident: 139_CR66
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2011.05.006
– volume: 12
  start-page: 257
  year: 2011
  ident: 139_CR15
  publication-title: J. Nonlinear Convex Anal.
– volume: 183
  start-page: 1
  year: 2007
  ident: 139_CR13
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2006.09.070
– volume: 19
  start-page: 397
  year: 2008
  ident: 139_CR45
  publication-title: SIAM J. Optim.
  doi: 10.1137/060655183
– volume: 20
  start-page: 602
  issue: 2
  year: 2009
  ident: 139_CR22
  publication-title: SIAM J. Optim.
  doi: 10.1137/08071692X
– volume: 14
  start-page: 877
  year: 1976
  ident: 139_CR53
  publication-title: SIAM J. Control. Optim.
  doi: 10.1137/0314056
– volume: 48
  start-page: 183
  year: 2010
  ident: 139_CR20
  publication-title: Glob. Optim.
  doi: 10.1007/s10898-009-9486-z
– volume-title: Variational Analysis and Generalized Differentiation. I. Basic Theory, Grundlehren der Mathematischen Wissenschaften
  year: 2006
  ident: 139_CR46
  doi: 10.1007/3-540-31247-1
– volume: 235
  start-page: 494
  year: 2014
  ident: 139_CR6
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2014.01.002
– volume: 15
  start-page: 953
  year: 2005
  ident: 139_CR10
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623403429093
– volume: 4
  start-page: 154
  year: 1970
  ident: 139_CR40
  publication-title: Rev. Francaise d’Inform. Recherche Oper.
– volume: 87
  start-page: 13
  year: 2005
  ident: 139_CR9
  publication-title: Ann. Polon. Math.
  doi: 10.4064/ap87-0-2
– ident: 139_CR59
– volume: 22
  start-page: 557
  year: 2014
  ident: 139_CR5
  publication-title: Set-Valued Var. Anal.
  doi: 10.1007/s11228-014-0279-2
– volume: 146
  start-page: 267
  year: 2010
  ident: 139_CR14
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-010-9667-4
– ident: 139_CR55
– volume-title: Variational Analysis and Applications
  year: 2018
  ident: 139_CR48
  doi: 10.1007/978-3-319-92775-6
– volume: 34
  start-page: 585
  year: 2014
  ident: 139_CR25
  publication-title: Pesqui. Oper.
  doi: 10.1590/0101-7438.2014.034.03.0585
– volume: 28
  start-page: 1104
  issue: 2
  year: 2018
  ident: 139_CR4
  publication-title: SIAM J. Optim.
  doi: 10.1137/16M107534X
– volume: 162
  start-page: 821
  year: 2014
  ident: 139_CR28
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-013-0327-3
– volume: 23
  start-page: 107
  year: 1998
  ident: 139_CR37
  publication-title: Acta Math. Vietnam
– volume-title: Field Theory in Social Science. Harper Torchbooks
  year: 1964
  ident: 139_CR36
– volume: 166
  start-page: 172
  year: 2015
  ident: 139_CR7
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0711-2
– volume: 64
  start-page: 79
  year: 2016
  ident: 139_CR1
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0367-3
– volume: 28
  start-page: 5
  year: 2004
  ident: 139_CR26
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/B:COAP.0000018877.86161.8b
– volume-title: Handbook of Organizational Change and Innovation
  year: 2004
  ident: 139_CR50
  doi: 10.1093/oso/9780195135008.001.0001
– volume-title: Nonlinear Multiobjective Optimization
  year: 1999
  ident: 139_CR41
– volume: 85
  start-page: 157
  year: 1999
  ident: 139_CR31
  publication-title: Math. Program.
  doi: 10.1007/s101070050050
– volume: 8
  start-page: 476
  year: 1998
  ident: 139_CR63
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623494274313
– volume: 9
  start-page: 707
  year: 1959
  ident: 139_CR29
  publication-title: Pac. J. Math.
  doi: 10.2140/pjm.1959.9.707
– volume-title: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems
  year: 1989
  ident: 139_CR38
– volume: 1
  start-page: 5
  year: 1947
  ident: 139_CR35
  publication-title: Hum. Relat.
  doi: 10.1177/001872674700100103
– volume: 69
  start-page: 297
  year: 2018
  ident: 139_CR67
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-017-9954-1
– volume: 2
  start-page: 379
  year: 2018
  ident: 139_CR39
  publication-title: J. Nonlinear Var. Anal.
– volume: 63
  start-page: 797
  year: 2015
  ident: 139_CR60
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-015-0282-7
– ident: 139_CR56
– volume: 166
  start-page: 199
  year: 1992
  ident: 139_CR12
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(92)90336-C
– volume: 59
  start-page: 63
  year: 2010
  ident: 139_CR49
  publication-title: Optimization
  doi: 10.1080/02331930903500282
– volume: 23
  start-page: 501
  year: 2015
  ident: 139_CR8
  publication-title: Set-Valued Var. Anal.
  doi: 10.1007/s11228-015-0319-6
– volume: 21
  start-page: 451
  year: 2003
  ident: 139_CR61
  publication-title: J. Comput. Math.
– volume: 86
  start-page: 319
  year: 1982
  ident: 139_CR64
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/0022-247X(82)90226-8
– volume: 120
  start-page: 111
  year: 2004
  ident: 139_CR32
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/B:JOTA.0000012735.86699.a1
– volume: 23
  start-page: 2169
  year: 2013
  ident: 139_CR3
  publication-title: SIAM J. Optim.
  doi: 10.1137/120866415
– volume: 205
  start-page: 247
  year: 1975
  ident: 139_CR16
  publication-title: Trans. Am. Math. Soc.
  doi: 10.1090/S0002-9947-1975-0367131-6
– volume: 256
  start-page: 37
  year: 1986
  ident: 139_CR30
  publication-title: Convex. Dual. Optim. Lect. Notes Econ. Math. Syst.
  doi: 10.1007/978-3-642-45610-7_3
– ident: 139_CR18
  doi: 10.1007/s10479-018-3104-8
– volume: 41
  start-page: 451
  year: 1983
  ident: 139_CR42
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/BF00935364
– ident: 139_CR62
  doi: 10.1016/S0304-0208(08)72402-2
– volume: 61
  start-page: 71
  year: 2015
  ident: 139_CR21
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-014-0159-1
– volume: 108
  start-page: 571
  year: 2001
  ident: 139_CR23
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1017535424813
– volume: 4
  start-page: 307
  year: 1980
  ident: 139_CR54
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(80)90142-3
– volume: 235
  start-page: 503
  year: 2014
  ident: 139_CR51
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2014.01.022
– volume: 256
  start-page: 17
  year: 2017
  ident: 139_CR11
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2016.05.026
– volume: 247
  start-page: 359
  year: 2015
  ident: 139_CR52
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2015.06.016
– ident: 139_CR57
– volume: 60
  start-page: 961
  year: 2011
  ident: 139_CR2
  publication-title: Optimization
  doi: 10.1080/02331931003770411
– volume: 54
  start-page: 461
  year: 2013
  ident: 139_CR19
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-012-9494-7
– volume: 93
  start-page: 273
  year: 1965
  ident: 139_CR43
  publication-title: Bull. Soc. Math. Fr.
  doi: 10.24033/bsmf.1625
– volume: 41
  start-page: 161
  year: 1988
  ident: 139_CR65
  publication-title: Math. Program.
  doi: 10.1007/BF01580762
– volume: 175
  start-page: 395
  year: 2005
  ident: 139_CR27
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2004.06.018
– volume-title: Vector Optimization: Theory, Applications and Extensions
  year: 2004
  ident: 139_CR33
  doi: 10.1007/978-3-540-24828-6
– volume: 169
  start-page: 280
  year: 2016
  ident: 139_CR34
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0847-0
– volume: 60
  start-page: 1009
  year: 2011
  ident: 139_CR24
  publication-title: Optimization
  doi: 10.1080/02331934.2010.522710
– volume-title: Optimization and Nonsmooth Analysis. Classics in Applied Mathematics
  year: 1990
  ident: 139_CR17
  doi: 10.1137/1.9781611971309
– volume: 61
  start-page: 1383
  year: 2012
  ident: 139_CR44
  publication-title: Optimization
  doi: 10.1080/02331934.2011.564623
– volume-title: Variational Analysis and Generalized Differentiation. II. Applications, Grundlehren der Mathematischen Wissenschaften
  year: 2006
  ident: 139_CR47
  doi: 10.1007/3-540-31246-3
SSID ssj0009732
Score 2.3039298
Snippet We consider the constrained multi-objective optimization problem of finding Pareto critical points of difference of convex functions. The new approach proposed...
SourceID hal
proquest
crossref
springer
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 263
SubjectTerms Ascent
Convex analysis
Convex and Discrete Geometry
Critical point
Economics and Finance
Goal programming
Group dynamics
Humanities and Social Sciences
Iterative methods
Management Science
Mathematical analysis
Mathematics
Mathematics and Statistics
Multiple objective analysis
Operations Research
Operations Research/Decision Theory
Optimization
Pareto optimization
Statistics
SummonAdditionalLinks – databaseName: Springer Nature - Connect here FIRST to enable access
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB7RwqEceLRFLCxohLgVSxs7aezjCrHqoVSIFtRb5Ke6VTepuktVfgD_m7GT7C6oVCqnKInjRM545ht75huA98JIbQgYMJMZxXJHfopxQrORFtp7oUTmEs_sYXl0JE9P1ZcuKWzeR7v3W5JJU68luxUxvCcm3UTcwshRf0jmTsaCDV-Pv6-odstUlmyk-D4jcy66VJnb-_jDHG2cxWDINaT51-ZosjmTp__3tc_gSYcxcdwKxXN44OtteLzGPEhnn5d0rfNt2IqQs2Vs3oFfY4yxLdMZdXHZTOsFtlWmkeAt9vVUrMcmYApZv8FoG5P44rTGFKHIGnPealJsSCfNumRPjKu-uLZnjosGU14Jup-1nk0tdgVu5rvwbfLp5OMB64o1MEuQZsFCGXJprPN0DM6HfKR5bsldkarQQUpbOM2FLmxwxpRBS1_w0iluuVYiL0rxAjbrpvYvAQmSKWEJyTmpcsMDuYhOZ4UvXOYyVboBZP0_q2zHZB4LalxUKw7mOPoVjX6VRr8aDWBv-cxly-NxZ-t3JArLhpGC-2B8WMVrkR-IIFN-nQ1g2EtK1U38ecWFiIs0pDgH8KGXjNXtf7_y1f2av4YtHj3_tBg0hM3F1Q__Bh7Za5KWq7dpQvwGfNcGWQ
  priority: 102
  providerName: Springer Nature
Title A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
URI https://link.springer.com/article/10.1007/s10589-019-00139-0
https://www.proquest.com/docview/2332006073
https://amu.hal.science/hal-02351104
Volume 75
WOSCitedRecordID wos000490228000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer Standard Collection
  customDbUrl:
  eissn: 1573-2894
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009732
  issn: 0926-6003
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB6xLQc4lLe6pawsxA0sEjvB8QktVatKtKtVy6NwifyKSMUmSzdU8AP434y9TndBohcujpI4D2nGM9-M5wHwjOtCaQQGVKda0syinaItVzRRXDnHJU9tqDN7JCaT4uxMTqPDbRHDKnuZGAS1bY33kb9knHvrFzny9fwb9V2j_O5qbKExgE1ENqkP6Tpm01XRXREalCWSvaKo2HlMmompc7kPFvIpPB4F0eQPxTT44sMi1zDnX9ukQfsc3Pnf_74LWxF3kvGSUe7BDdfch9tr1QgfwK8x8UEt9Qznzdu66ciyvTRBXEv6RirGkbYiIVb9B_FKMfAtqRsSQhNpq8-XIpS0KIxmMcuTeHcvWdssJ11LQkIJsT8bNasNiZ1tFg_h_cH-u71DGrs0UINYpqOVqLJCG-vwWFlXZYlimUE7pZC5qorC5FYxrnJTWa1FpQqXM2ElM0xJnuWCP4KNpm3cNhDEYpIbhHC2kJlmFdqGVqW5y21qUynsENKeRKWJJcx9J42v5ar4sidriWQtA1nLZAjPr56ZLwt4XDv7KVL-aqKvvX04Pir9NV8YCLFSdpkOYbcndRlX_KJc0XkIL3pmWd3-9yd3rn_bY7jFvIkfvD67sNFdfHdP4Ka57OrFxQgG4uOnEWy-2Z9MT_DsraA4Hid7o7AS_ChOcZzmn3E8Of3wG0W0DrQ
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB21BQk48I1YKGAhOIFFYickPiC0Aqqtuqx6KFJvwV8RQWyydEOhP4C_w29kxkm6CxK99cApUuI4kvPseR7PvAF4Ik2uDRIDbmKjeOJwn2Kc1DzSUnsvlYxd0JmdZrNZfnio9jfg15ALQ2GVw5oYFmrXWPKRvxBS0u4XEfl68ZVT1Sg6XR1KaHSw2PMn33HLtny1-xb_71Mhdt4dvJnwvqoAt2h7W15mZZIb6zxeS-fLJNIiscirc5XqMs9t6rSQOrWlMyYrde5TkTklrNBKJmkmsd9NuJCQshiFCor9lchvFgqiRUq85EgkZJ-k06fqpRScRClDxLp49Ich3PxEYZhrHPevY9lg7Xau_W_jdB2u9ryajbuJcAM2fH0TrqypLd6Cn2NGQTvVHNstmqpuWVc-myFvZ0OhGOtZU7IQi_-DkdEP85JVNQuhl7wxnzsTwRpcbOd9FisjdzZbCwZgbcNCwgxzJ7WeV5b1lXuWt-HDuYzDHdiqm9rfBYZcU0mLFNXlKjGixL2v03HqUxe7WGVuBPEAicL2Eu1UKeRLsRKXJhgVCKMiwKiIRvDs9J1FJ1ByZuvHiLTThqQtPhlPC7pHwkfIBZPjeATbA7SKfkVbFitcjeD5AM7V439_8t7ZvT2CS5OD99Niujvbuw-XBbkzgodrG7bao2_-AVy0x221PHoY5hqDj-cN2t923Ge_
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB21BSE48FnE0gIWghNYTeyExAeEVpRVq65WewCp4hL8KYLYZOmG0v6A_qn-OsZO0l2Q6K0HTpESx5GcZ_vN-M0MwAuucqmQGFAVK0ETg3aKMlzSSHJpLRc8NiHP7DibTPLDQzFdg_M-FsbLKvs1MSzUptbeR77DOPfWLyJyx3WyiOnu6N38B_UVpPxJa19Oo4XIgT39hebb4u3-Lv7rl4yNPnx8v0e7CgNU4z7cUJe5JFfaWLw6Y10SSZZo5Ni5SKXLc50aybhMtTNKZU7mNmWZEUwzKXiSZhz7XYdrGdqYXk44TT8vE_5moThaJNgbiqSCdwE7Xdhe6oVKPnzIMzAa_bEprn_1kswVvvvXEW3Y-UZ3_ucxuwu3O75Nhu0EuQdrtroPt1ayMD6AsyHxYp5yhu3mdVk1pC2rTZDPk76AjLakdiRo9E-IJwNhvpKyIkGSSWv1rd06SI2L8KyLbiXezU1WRAKkqUkIpCHmtJKzUpOuos9iEz5dyTg8hI2qruwjIMhBBddIXU0uEsUc2sRGxqlNTWxikZkBxD08Ct2lbvcVRL4Xy6TTHlIFQqoIkCqiAby6eGfeJi65tPVzRN1FQ59zfG84Lvw9nxAJOWJyHA9gu4dZ0a10i2KJsQG87oG6fPzvTz6-vLdncAOxWoz3JwdbcJN5L0dwfG3DRnP00z6B6_q4KRdHT8O0I_DlqjH7G-FocKs
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=A+proximal+point+method+for+difference+of+convex+functions+in+multi-objective+optimization+with+application+to+group+dynamic+problems&rft.jtitle=Computational+optimization+and+applications&rft.au=Glaydston+de+Carvalho+Bento&rft.au=Sandro+Dimy+Barbosa+Bitar&rft.au=Jo%C3%A3o+Xavier+da+Cruz+Neto&rft.au=Soubeyran%2C+Antoine&rft.date=2020-01-01&rft.pub=Springer+Nature+B.V&rft.issn=0926-6003&rft.eissn=1573-2894&rft.volume=75&rft.issue=1&rft.spage=263&rft.epage=290&rft_id=info:doi/10.1007%2Fs10589-019-00139-0&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0926-6003&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0926-6003&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0926-6003&client=summon