A modified inertial proximal minimization algorithm for structured nonconvex and nonsmooth problem

We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The objective function in question is an aggregation of a smooth function with an associated linear operator, a nonsmooth function dependent on an in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of inequalities and applications Ročník 2024; číslo 1; s. 124 - 23
Hlavní autoři: Xue, Zhonghui, Ma, Qianfeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cham Springer International Publishing 20.09.2024
Springer Nature B.V
SpringerOpen
Témata:
ISSN:1029-242X, 1025-5834, 1029-242X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The objective function in question is an aggregation of a smooth function with an associated linear operator, a nonsmooth function dependent on an independent variable, and a mixed function involving two variables. Throughout the iterative procedure, parameters are selected employing a straightforward approach, and weak inertial terms are incorporated into two subproblems within the update sequence. Under a set of lenient conditions, we demonstrate that the sequence engendered by our algorithm is bounded. Furthermore, we establish the global and strong convergence of the algorithmic sequence, contingent upon the assumption that the principal function adheres to the Kurdyka–Łojasiewicz (KL) property. Ultimately, the numerical outcomes corroborate the algorithm’s feasibility and efficacy.
AbstractList We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The objective function in question is an aggregation of a smooth function with an associated linear operator, a nonsmooth function dependent on an independent variable, and a mixed function involving two variables. Throughout the iterative procedure, parameters are selected employing a straightforward approach, and weak inertial terms are incorporated into two subproblems within the update sequence. Under a set of lenient conditions, we demonstrate that the sequence engendered by our algorithm is bounded. Furthermore, we establish the global and strong convergence of the algorithmic sequence, contingent upon the assumption that the principal function adheres to the Kurdyka–Łojasiewicz (KL) property. Ultimately, the numerical outcomes corroborate the algorithm’s feasibility and efficacy.
We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The objective function in question is an aggregation of a smooth function with an associated linear operator, a nonsmooth function dependent on an independent variable, and a mixed function involving two variables. Throughout the iterative procedure, parameters are selected employing a straightforward approach, and weak inertial terms are incorporated into two subproblems within the update sequence. Under a set of lenient conditions, we demonstrate that the sequence engendered by our algorithm is bounded. Furthermore, we establish the global and strong convergence of the algorithmic sequence, contingent upon the assumption that the principal function adheres to the Kurdyka–Łojasiewicz (KL) property. Ultimately, the numerical outcomes corroborate the algorithm’s feasibility and efficacy.
Abstract We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The objective function in question is an aggregation of a smooth function with an associated linear operator, a nonsmooth function dependent on an independent variable, and a mixed function involving two variables. Throughout the iterative procedure, parameters are selected employing a straightforward approach, and weak inertial terms are incorporated into two subproblems within the update sequence. Under a set of lenient conditions, we demonstrate that the sequence engendered by our algorithm is bounded. Furthermore, we establish the global and strong convergence of the algorithmic sequence, contingent upon the assumption that the principal function adheres to the Kurdyka–Łojasiewicz (KL) property. Ultimately, the numerical outcomes corroborate the algorithm’s feasibility and efficacy.
ArticleNumber 124
Author Ma, Qianfeng
Xue, Zhonghui
Author_xml – sequence: 1
  givenname: Zhonghui
  surname: Xue
  fullname: Xue, Zhonghui
  email: hnlgxzh@163.com
  organization: Shanghai Publishing and Printing College
– sequence: 2
  givenname: Qianfeng
  surname: Ma
  fullname: Ma, Qianfeng
  organization: Shanghai Publishing and Printing College
BookMark eNp9kUtLxDAUhYMoqKN_wFXBdfUmaTPpUsQXCG4U3IU8xwxtMiYdUX-9mamoK1e5Cfd-95ycQ7QbYrAInWA4w5iz84wpY1ADaWqgBFiNd9ABBtLVpCHPu3_qfXSY8xKAYMqbA6QuqiEa77w1lQ82jV721SrFdz-UYvDBD_5Tjj6GSvaLmPz4MlQupiqPaa3HdSpzRYuO4c2-VzJsb3mIcXzZYFRvhyO052Sf7fH3OUNP11ePl7f1_cPN3eXFfa0ph7HupKK8IxxkA0UtUEPbRlOlDLONawFzynCjWmM50dx1TAE3DXfMaay1tnSG7iauiXIpVqk4SB8iSi-2DzEthCz-dG-FM4TZubF4g1DGSNUZ4MoRqdq2rC-s04lVPLyubR7FMq5TKPIFxTAvX9wWPTNEpi6dYs7Jup-tGMQmFzHlIkouYpuL2KDpNJRLc1jY9Iv-Z-oLdAiUUg
Cites_doi 10.1007/s10107-011-0484-9
10.1109/TIT.2006.871582
10.1287/moor.2019.1008
10.1137/14095697X
10.1007/s10915-010-9408-8
10.1186/s13660-017-1504-y
10.1016/0167-2789(92)90242-F
10.1109/ACCESS.2019.2914461
10.1007/s10957-015-0730-z
10.1137/18M1190689
10.1287/moor.1100.0449
10.1088/1361-6420/ac0966
10.1023/A:1017501703105
10.1137/S0363012998338806
10.1007/s10898-019-00819-5
10.1007/BF01397082
10.1007/s10107-013-0701-9
10.1137/140998135
10.1137/0716071
10.1137/16M1064064
10.1080/00207160.2020.1812585
10.1016/0041-5553(64)90137-5
10.1007/s10898-022-01176-6
10.1137/050626090
10.1137/140980910
10.1007/s10851-015-0565-0
10.1007/s10915-018-0757-z
10.1090/S0025-5718-2012-02598-1
ContentType Journal Article
Copyright The Author(s) 2024
The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: The Author(s) 2024
– notice: The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID C6C
AAYXX
CITATION
7TB
8FD
8FE
8FG
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOA
DOI 10.1186/s13660-024-03206-1
DatabaseName Springer Nature OA Free Journals
CrossRef
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
Engineering Research Database
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
ProQuest Engineering Collection
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Publicly Available Content Database
ProQuest One Academic Middle East (New)
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
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Publicly Available Content Database

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Mathematics
EISSN 1029-242X
EndPage 23
ExternalDocumentID oai_doaj_org_article_fd26e7de108d4bddab9d08bf2ab55401
10_1186_s13660_024_03206_1
GrantInformation_xml – fundername: National Natural Science Foundation of China under grants
  grantid: 71901145; 71901145
– fundername: National Natural Science Foundation of China
  grantid: 72071130; 72071130
GroupedDBID -A0
0R~
29K
2WC
4.4
40G
5GY
5VS
8FE
8FG
8R4
8R5
AAFWJ
AAJSJ
AAKKN
ABDBF
ABEEZ
ABFTD
ABJCF
ACACY
ACGFO
ACGFS
ACIPV
ACIWK
ACUHS
ACULB
ADBBV
ADINQ
AENEX
AFGXO
AFKRA
AFPKN
AHBYD
AHYZX
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMTXH
ARAPS
BCNDV
BENPR
BGLVJ
C24
C6C
CCPQU
CS3
D-I
DU5
EBLON
EBS
ESX
GROUPED_DOAJ
HCIFZ
J9A
K6V
K7-
KQ8
L6V
M7S
M~E
OK1
P2P
P62
PIMPY
PROAC
PTHSS
Q2X
REM
RHU
RNS
RSV
SMT
SOJ
TUS
U2A
~8M
AASML
AAYXX
AFFHD
AMVHM
CITATION
OVT
PHGZM
PHGZT
PQGLB
7TB
8FD
ABUWG
AZQEC
DWQXO
FR3
GNUQQ
JQ2
KR7
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c380t-9ab389280a4010203d354c3bbd6e4f50183614b5de82c8f96b08d48f6fc1ccce3
IEDL.DBID M7S
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001316464700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1029-242X
1025-5834
IngestDate Fri Oct 03 12:53:43 EDT 2025
Sat Oct 18 22:49:39 EDT 2025
Sat Nov 29 06:10:40 EST 2025
Fri Feb 21 02:38:27 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords 49K99
Kurdyka–Łojasiewicz property
49J53
Nonconvex-nonsmooth optimization
Weak inertial
Proximal minimization algorithm
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c380t-9ab389280a4010203d354c3bbd6e4f50183614b5de82c8f96b08d48f6fc1ccce3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/3107320518?pq-origsite=%requestingapplication%
PQID 3107320518
PQPubID 237789
PageCount 23
ParticipantIDs doaj_primary_oai_doaj_org_article_fd26e7de108d4bddab9d08bf2ab55401
proquest_journals_3107320518
crossref_primary_10_1186_s13660_024_03206_1
springer_journals_10_1186_s13660_024_03206_1
PublicationCentury 2000
PublicationDate 2024-09-20
PublicationDateYYYYMMDD 2024-09-20
PublicationDate_xml – month: 09
  year: 2024
  text: 2024-09-20
  day: 20
PublicationDecade 2020
PublicationPlace Cham
PublicationPlace_xml – name: Cham
– name: Heidelberg
PublicationTitle Journal of inequalities and applications
PublicationTitleAbbrev J Inequal Appl
PublicationYear 2024
Publisher Springer International Publishing
Springer Nature B.V
SpringerOpen
Publisher_xml – name: Springer International Publishing
– name: Springer Nature B.V
– name: SpringerOpen
References Rudin, Osher, Fatemi (CR27) 1992; 60
Gao, Cai, Han (CR16) 2020; 76
CR17
Liu, Shen, Gu (CR21) 2017; 7
Bot, Kanzler (CR9) 2021; 394
CR15
Bot, Csetnek, Nguyen (CR8) 2019; 29
Zhang, Burger, Osher (CR32) 2010; 46
Donoho (CR14) 2006; 52
Hong, Luo, Razaviyayn (CR18) 2015
Polyak (CR26) 1964; 4
Bolte, Sabach, Teboulle (CR5) 2014; 146
Chen, Ma, Yang (CR12) 2015; 25
Wang, Yin, Zeng (CR30) 2019; 78
Auslender (CR3) 1971; 18
Bian, Liang, Zhang (CR4) 2021; 37
Pock, Sabach (CR25) 2016; 9
Tseng (CR28) 2000; 38
Attouch, Bolte, Svaiter (CR2) 2013; 137
Ouyang, Chen, Lan, Pasiliao (CR24) 2015; 8
Yang, Yuan (CR31) 2013; 82
CR6
Bot, Csetnek (CR7) 2016; 171
Attouch, Bolte, Redont, Soubeyran (CR1) 2010; 35
Ochs, Brox, Pock (CR22) 2015; 53
Ortega, Rheinboldt (CR23) 1970
Combettes, Wajs (CR13) 2005; 4
Chao, Zhang, Jian (CR11) 2021; 98
Bot, Nguyen (CR10) 2020; 45
Lions, Mercier (CR20) 1979; 16
Zhao, Dong, Rassias, Wang (CR34) 2022; 84
Li, Pong (CR19) 2015; 25
Tseng (CR29) 2001; 109
Zhang, He (CR33) 2017; 2017
P.L. Lions (3206_CR20) 1979; 16
H. Attouch (3206_CR2) 2013; 137
X. Gao (3206_CR16) 2020; 76
J.M. Ortega (3206_CR23) 1970
R.I. Bot (3206_CR8) 2019; 29
R.I. Bot (3206_CR9) 2021; 394
C.H. Chen (3206_CR12) 2015; 25
L.I. Rudin (3206_CR27) 1992; 60
T. Pock (3206_CR25) 2016; 9
A. Auslender (3206_CR3) 1971; 18
Y. Ouyang (3206_CR24) 2015; 8
Q. Liu (3206_CR21) 2017; 7
Y. Wang (3206_CR30) 2019; 78
Y. Zhang (3206_CR33) 2017; 2017
P.L. Combettes (3206_CR13) 2005; 4
P. Ochs (3206_CR22) 2015; 53
B.T. Polyak (3206_CR26) 1964; 4
3206_CR15
3206_CR17
3206_CR6
P. Tseng (3206_CR28) 2000; 38
J. Yang (3206_CR31) 2013; 82
M.T. Chao (3206_CR11) 2021; 98
J. Zhao (3206_CR34) 2022; 84
P. Tseng (3206_CR29) 2001; 109
G. Li (3206_CR19) 2015; 25
F.M. Bian (3206_CR4) 2021; 37
X.Q. Zhang (3206_CR32) 2010; 46
M. Hong (3206_CR18) 2015
H. Attouch (3206_CR1) 2010; 35
R.I. Bot (3206_CR7) 2016; 171
J. Bolte (3206_CR5) 2014; 146
R.I. Bot (3206_CR10) 2020; 45
D.L. Donoho (3206_CR14) 2006; 52
References_xml – volume: 137
  start-page: 91
  year: 2013
  end-page: 129
  ident: CR2
  article-title: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
  publication-title: Math. Program.
  doi: 10.1007/s10107-011-0484-9
– volume: 52
  start-page: 1289
  issue: 4
  year: 2006
  end-page: 1306
  ident: CR14
  article-title: Compressed sensing
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2006.871582
– volume: 45
  start-page: 682
  issue: 2
  year: 2020
  end-page: 712
  ident: CR10
  article-title: The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2019.1008
– volume: 8
  start-page: 644
  issue: 1
  year: 2015
  end-page: 681
  ident: CR24
  article-title: An accelerated linearized alternating direction method of multipliers
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/14095697X
– volume: 394
  issue: 10
  year: 2021
  ident: CR9
  article-title: A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function
  publication-title: Appl. Math. Comput.
– volume: 46
  start-page: 20
  year: 2010
  end-page: 46
  ident: CR32
  article-title: A unified primal-dual algorithm framework based on Bregman iteration
  publication-title: J. Sci. Comput.
  doi: 10.1007/s10915-010-9408-8
– volume: 2017
  year: 2017
  ident: CR33
  article-title: Inertial proximal alternating minimization for nonconvex and nonsmooth problems
  publication-title: J. Inequal. Appl.
  doi: 10.1186/s13660-017-1504-y
– volume: 60
  start-page: 259
  issue: 1–4
  year: 1992
  end-page: 268
  ident: CR27
  article-title: Nonlinear total variation based noise removal algorithms
  publication-title: Phys. D, Nonlinear Phenom.
  doi: 10.1016/0167-2789(92)90242-F
– volume: 7
  start-page: 76131
  year: 2017
  end-page: 76144
  ident: CR21
  article-title: Linearized ADMM for non-convex non-smooth optimization with convergence analysis
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2914461
– year: 1970
  ident: CR23
  publication-title: Iterative Solution of Nonlinear Equations in Several Variables
– ident: CR6
– volume: 171
  start-page: 600
  issue: 2
  year: 2016
  end-page: 616
  ident: CR7
  article-title: An inertial Tseng’s type proximal algorithm for nonsmooth and nonconvex optimization problems
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0730-z
– volume: 29
  start-page: 1300
  issue: 2
  year: 2019
  end-page: 1328
  ident: CR8
  article-title: A proximal minimization algorithm for structured nonconvex and nonsmooth problems
  publication-title: SIAM J. Optim.
  doi: 10.1137/18M1190689
– volume: 35
  start-page: 438
  issue: 2
  year: 2010
  end-page: 457
  ident: CR1
  article-title: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka–Lojasiewicz inequality
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1100.0449
– volume: 37
  issue: 7
  year: 2021
  ident: CR4
  article-title: A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization
  publication-title: Inverse Probl.
  doi: 10.1088/1361-6420/ac0966
– volume: 109
  start-page: 475
  issue: 3
  year: 2001
  end-page: 494
  ident: CR29
  article-title: Convergence of a block coordinate descent method for nondifferentiable minimization
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1017501703105
– volume: 38
  start-page: 431
  issue: 2
  year: 2000
  end-page: 446
  ident: CR28
  article-title: A modified forward–backward splitting method for maximal monotone mappings
  publication-title: SIAM J. Control Optim.
  doi: 10.1137/S0363012998338806
– volume: 76
  start-page: 863
  issue: 4
  year: 2020
  end-page: 887
  ident: CR16
  article-title: A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-019-00819-5
– ident: CR15
– start-page: 3836
  year: 2015
  end-page: 3840
  ident: CR18
  article-title: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
  publication-title: IEEE
– volume: 18
  start-page: 213
  issue: 3
  year: 1971
  end-page: 223
  ident: CR3
  article-title: Méthodes numériques pour la décomposition et la minimisation de fonctions nondifférentiables
  publication-title: Numer. Math.
  doi: 10.1007/BF01397082
– volume: 146
  start-page: 459
  year: 2014
  end-page: 494
  ident: CR5
  article-title: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
  publication-title: Math. Program.
  doi: 10.1007/s10107-013-0701-9
– ident: CR17
– volume: 25
  start-page: 2434
  issue: 4
  year: 2015
  end-page: 2460
  ident: CR19
  article-title: Global convergence of splitting methods for nonconvex composite optimization
  publication-title: SIAM J. Optim.
  doi: 10.1137/140998135
– volume: 16
  start-page: 964
  issue: 6
  year: 1979
  end-page: 979
  ident: CR20
  article-title: Splitting algorithms for the sum of two nonlinear operators
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0716071
– volume: 9
  start-page: 1756
  issue: 4
  year: 2016
  end-page: 1787
  ident: CR25
  article-title: Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/16M1064064
– volume: 98
  start-page: 1199
  issue: 6
  year: 2021
  end-page: 1217
  ident: CR11
  article-title: An inertial proximal alternating direction method of multipliers for nonconvex optimization
  publication-title: Int. J. Comput. Math.
  doi: 10.1080/00207160.2020.1812585
– volume: 4
  start-page: 1
  issue: 5
  year: 1964
  end-page: 17
  ident: CR26
  article-title: Some methods of speeding up the convergence of iteration methods
  publication-title: USSR Comput. Math. Math. Phys.
  doi: 10.1016/0041-5553(64)90137-5
– volume: 84
  start-page: 941
  year: 2022
  end-page: 966
  ident: CR34
  article-title: Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-022-01176-6
– volume: 4
  start-page: 1168
  issue: 4
  year: 2005
  end-page: 1200
  ident: CR13
  article-title: Signal recovery by proximal forward–backward splitting
  publication-title: Multiscale Model. Simul.
  doi: 10.1137/050626090
– volume: 25
  start-page: 2120
  issue: 4
  year: 2015
  end-page: 2142
  ident: CR12
  article-title: A general inertial proximal point algorithm for mixed variational inequality problem
  publication-title: SIAM J. Optim.
  doi: 10.1137/140980910
– volume: 53
  start-page: 171
  issue: 2
  year: 2015
  end-page: 181
  ident: CR22
  article-title: iPiasco: inertial proximal algorithm for strongly convex optimization
  publication-title: J. Math. Imaging Vis.
  doi: 10.1007/s10851-015-0565-0
– volume: 78
  start-page: 29
  year: 2019
  end-page: 63
  ident: CR30
  article-title: Global convergence of ADMM in nonconvex nonsmooth optimization
  publication-title: J. Sci. Comput.
  doi: 10.1007/s10915-018-0757-z
– volume: 82
  start-page: 301
  issue: 281
  year: 2013
  end-page: 329
  ident: CR31
  article-title: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-2012-02598-1
– volume-title: Iterative Solution of Nonlinear Equations in Several Variables
  year: 1970
  ident: 3206_CR23
– volume: 84
  start-page: 941
  year: 2022
  ident: 3206_CR34
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-022-01176-6
– volume: 46
  start-page: 20
  year: 2010
  ident: 3206_CR32
  publication-title: J. Sci. Comput.
  doi: 10.1007/s10915-010-9408-8
– volume: 137
  start-page: 91
  year: 2013
  ident: 3206_CR2
  publication-title: Math. Program.
  doi: 10.1007/s10107-011-0484-9
– volume: 8
  start-page: 644
  issue: 1
  year: 2015
  ident: 3206_CR24
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/14095697X
– start-page: 3836
  volume-title: IEEE
  year: 2015
  ident: 3206_CR18
– volume: 53
  start-page: 171
  issue: 2
  year: 2015
  ident: 3206_CR22
  publication-title: J. Math. Imaging Vis.
  doi: 10.1007/s10851-015-0565-0
– volume: 78
  start-page: 29
  year: 2019
  ident: 3206_CR30
  publication-title: J. Sci. Comput.
  doi: 10.1007/s10915-018-0757-z
– volume: 4
  start-page: 1
  issue: 5
  year: 1964
  ident: 3206_CR26
  publication-title: USSR Comput. Math. Math. Phys.
  doi: 10.1016/0041-5553(64)90137-5
– volume: 171
  start-page: 600
  issue: 2
  year: 2016
  ident: 3206_CR7
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-015-0730-z
– volume: 45
  start-page: 682
  issue: 2
  year: 2020
  ident: 3206_CR10
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.2019.1008
– volume: 76
  start-page: 863
  issue: 4
  year: 2020
  ident: 3206_CR16
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-019-00819-5
– volume: 29
  start-page: 1300
  issue: 2
  year: 2019
  ident: 3206_CR8
  publication-title: SIAM J. Optim.
  doi: 10.1137/18M1190689
– volume: 109
  start-page: 475
  issue: 3
  year: 2001
  ident: 3206_CR29
  publication-title: J. Optim. Theory Appl.
  doi: 10.1023/A:1017501703105
– volume: 9
  start-page: 1756
  issue: 4
  year: 2016
  ident: 3206_CR25
  publication-title: SIAM J. Imaging Sci.
  doi: 10.1137/16M1064064
– volume: 37
  issue: 7
  year: 2021
  ident: 3206_CR4
  publication-title: Inverse Probl.
  doi: 10.1088/1361-6420/ac0966
– volume: 2017
  year: 2017
  ident: 3206_CR33
  publication-title: J. Inequal. Appl.
  doi: 10.1186/s13660-017-1504-y
– ident: 3206_CR6
– volume: 38
  start-page: 431
  issue: 2
  year: 2000
  ident: 3206_CR28
  publication-title: SIAM J. Control Optim.
  doi: 10.1137/S0363012998338806
– volume: 35
  start-page: 438
  issue: 2
  year: 2010
  ident: 3206_CR1
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1100.0449
– volume: 7
  start-page: 76131
  year: 2017
  ident: 3206_CR21
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2019.2914461
– volume: 52
  start-page: 1289
  issue: 4
  year: 2006
  ident: 3206_CR14
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/TIT.2006.871582
– volume: 146
  start-page: 459
  year: 2014
  ident: 3206_CR5
  publication-title: Math. Program.
  doi: 10.1007/s10107-013-0701-9
– volume: 394
  issue: 10
  year: 2021
  ident: 3206_CR9
  publication-title: Appl. Math. Comput.
– volume: 25
  start-page: 2120
  issue: 4
  year: 2015
  ident: 3206_CR12
  publication-title: SIAM J. Optim.
  doi: 10.1137/140980910
– volume: 25
  start-page: 2434
  issue: 4
  year: 2015
  ident: 3206_CR19
  publication-title: SIAM J. Optim.
  doi: 10.1137/140998135
– volume: 18
  start-page: 213
  issue: 3
  year: 1971
  ident: 3206_CR3
  publication-title: Numer. Math.
  doi: 10.1007/BF01397082
– ident: 3206_CR17
– volume: 4
  start-page: 1168
  issue: 4
  year: 2005
  ident: 3206_CR13
  publication-title: Multiscale Model. Simul.
  doi: 10.1137/050626090
– volume: 98
  start-page: 1199
  issue: 6
  year: 2021
  ident: 3206_CR11
  publication-title: Int. J. Comput. Math.
  doi: 10.1080/00207160.2020.1812585
– ident: 3206_CR15
– volume: 16
  start-page: 964
  issue: 6
  year: 1979
  ident: 3206_CR20
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0716071
– volume: 82
  start-page: 301
  issue: 281
  year: 2013
  ident: 3206_CR31
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-2012-02598-1
– volume: 60
  start-page: 259
  issue: 1–4
  year: 1992
  ident: 3206_CR27
  publication-title: Phys. D, Nonlinear Phenom.
  doi: 10.1016/0167-2789(92)90242-F
SSID ssj0021384
ssib044744598
ssib008501289
Score 2.3371615
Snippet We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems. The...
Abstract We introduce an enhanced inertial proximal minimization algorithm tailored for a category of structured nonconvex and nonsmooth optimization problems....
SourceID doaj
proquest
crossref
springer
SourceType Open Website
Aggregation Database
Index Database
Publisher
StartPage 124
SubjectTerms Algorithms
Analysis
Applications of Mathematics
Approximation
Dependent variables
Independent variables
Kurdyka–Łojasiewicz property
Linear operators
Mathematics
Mathematics and Statistics
Nonconvex-nonsmooth optimization
Optimization
Parameter modification
Proximal minimization algorithm
Weak inertial
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT9wwELUqxIELhdKK5Us-9FYskthx7CMgECfUQytxszz-KCsRttpsK34-Y8cpBQlx4ZY4iWzNszNvZM8bQr7WwSur28hii7GJsK1jAFqyNjRaWJAeOORiE931tbq50d__K_WVzoSN8sCj4U6ib2TofKgr5QV4b0H7SkFsLKAnHDO3qk5PwVQJtWquxJQio-TJUHMpK4b-iKWC4ZLVz9xQVut_RjFf7IpmZ3O5RTYLS6Sn4-i2yYdw_4l8LIyRlvU47BA4pf3Cz2NqTVl8uFzvaDqZMu_xIsmG9CXPktq7X4vlfHXbU6SpdJSN_bPE7zD-z0fPH6i9z3dDv0D4aCk185n8vLz4cX7FStUE5riqVkxbQBLSqMqKpBdXcc9b4TiAl0HEpN_H0SVD64NqnIpaQrKsijK62jkX-Beyhn2FXUI5NOC17XiwIDpZIRl0yJGiahsBAdyMfJuMaH6P4hgmBxVKmtHkBk1usslNPSNnyc7_3kzC1rkB4TYFbvMW3DNyMKFkymobDFLUDvtoazUjxxNyT49fH9Leewxpn2w0eWZp_OUckDUEMBySdfd3NR-WR3lePgJslelg
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: SpringerOpen
  dbid: C24
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NTxUxEG8IctADCGh4gKYHb9K4u-122yMSiReJB0y4NZ1-4EvYt-Ttg_DnM-3rYjB60Nt-tNumM7P9TTrzG0I-1MErq9vIYou-ibCtYwBasjY0WliQHjjkYhPdxYW6utLfS1LYOEW7T0eS-U-dzVrJT2PNpawY7iksFf2WDH2eF22tdArkO0s5DsXNqrkSU3rMH_s924IyU_8zePnbiWjeaM53_m-Kr8l2AZb0dK0Ju2QjLPbITgGZtJjwuEdefXsiah33CZzSfvDzmNqkNEC09xuaQlvmPV4k3pG-JGpSe3M9LOernz1FnEvXvLN3S-y3GBY5dv2B2kW-G_sB5U9LrZo35Mf5l8uzr6yUXWCOq2rFtAVEMY2qrEiEcxX3vBWOA3gZREwEgBz3dGh9UI1TUUuolBcqyuhq51zgb8kmjhUOCOXQgNe248GC6GSFaNIhyIqqbQQEcDPycZKEuV2za5jslShp1otpcDFNXkxTz8jnJKynlokZOz8YltemGJqJvpGh86FOkwLvLWhfKYiNBUROFX7keBK1KeY6GsS4HY6B2jQjJ5Nof73--5QO_635EXnZZO3Q-Hc6JpsoqvCObLn71Xxcvs9q_AjrYe_V
  priority: 102
  providerName: Springer Nature
Title A modified inertial proximal minimization algorithm for structured nonconvex and nonsmooth problem
URI https://link.springer.com/article/10.1186/s13660-024-03206-1
https://www.proquest.com/docview/3107320518
https://doaj.org/article/fd26e7de108d4bddab9d08bf2ab55401
Volume 2024
WOSCitedRecordID wos001316464700001&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: DOA
  dateStart: 20050101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044744598
  issn: 1029-242X
  databaseCode: M~E
  dateStart: 0
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: P5Z
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: K7-
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: M7S
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: BENPR
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: PIMPY
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerOpen
  customDbUrl:
  eissn: 1029-242X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021384
  issn: 1029-242X
  databaseCode: C24
  dateStart: 20051201
  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/eLvHCXMwpV1Lb9QwELZoy4EL5SkWysoHbmA18Sv2CbVVKxBiFfGQCpfIz7JSsymbBfHzGXu9WxUJLlyixHFsR9945vNrBqEXdfDKaBFJFDA24UY4Yq2WRASqubHSW2ZzsIlmNlPn57otE25j2Va50YlZUfvBpTnyQ6AhDaMgQur11XeSokal1dUSQmMH7SUvCXXeuvdxK09KJPW7NdecN5wLvV1loDXLEYnrFNJVKMY3h2qUPBxrJmVFwIKRFGJckvqG4cr-_W-Q0j_WUbN5Otv_3x-7h-4WYoqP1pJ0H90Kiwdov5BUXFTA-BDZI9wPfh5Tajo4CBriEqfNMPMebpKnkr4c7cTm8gIqWn3rMTBjvPZU-2MJ3y2GRd7t_gubRX4a-wEkBpfoNo_Q57PTTydvSAnUQBxT1YpoY4H3UFUZnlzUVcwzwR2z1svAY3IZyIAFWOGDok5FLW2lPFdRRlc75wJ7jHahrvAEYWap9do0LBjLG1kB_3QAT1SCchusm6CXGxS6q7U_ji6PY5Ts1ph1gFmXMevqCTpOQG1zJl_aOWFYXnSla3bRUxkaH-rUKOu9sdpXykZqLHCtCgo52ADXlQ4-dteoTdCrDfTXr__epKf_Lu0ZukOz0GnQXwdoF6AJz9Ft93M1H5dTtHd8Oms_TNHOCeXTPH8A13cNmWbBh2srvkKu9u379stvj20Fxw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Jb9QwFLZKQaIXylYxUMAHOIHVxFucA0JlqVpNGXEoUm_GaxmpM2knw_an-I08O8lURYJbD9wSJ3Hs-HuLY7_3IfSsDF6ZWkQSBcxNuBGOWFtLIgKtubHSW2Yz2UQ1majj4_rjGvo1xMKkbZWDTsyK2jcu_SPfATekYhQgpF6fnZPEGpVWVwcKjQ4W4_DzO0zZ2lcH72B8n1O69_7o7T7pWQWIY6pYktpYMNJUFYanfGoF80xwx6z1MvCY8tsxMFlW-KCoU7GWtlCeqyijK51zgUG919B1zlSV5GpckRV-lUjqfuUecF5xLurVqgYtWWZALhOFrFCMD0E8Su60JZOyIGAxSaI0l6S8ZCgzn8AlJ_iPddtsDvc2_7cPeRvd6h1vvNtJyh20FuZ30WbvhONexbX3kN3Fs8ZPYypNgZGgAU9x2uwzncFBysQy60NXsTk9gY4tv8wweP64y8T7dQHPzZt53s3_A5t5PmtnDUgE7tl77qNPV9LTLbQO7woPEGaWWl-bigVjeSUL8K8dwCEqQbkN1o3Qi2HU9VmXb0TneZqSusOIBozojBFdjtCbBIzVnSlXeC5oFie6Vz06eipD5UOZGmW9N7b2hbKRGgu-ZAGVbA9A0b0Ca_UFSkbo5QC1i8t_b9LDf9f2FN3cP_pwqA8PJuNHaINmwNegq7fROgxTeIxuuG_Labt4kkULo89XDcHflrJbJg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Jb9QwFLZKQYgLZRUDBXyAE0STeIt9QKhQRlRFozmAVHExXstInUmZDNtf49fx7CRTFQluPXBLnMSx489viZ_fh9CTKnhpFI9F5OCbMMNdYa0SBQ9EMWOFt9Rmsol6OpVHR2q2hX4Ne2FSWOUgE7Og9o1L_8jHYIbUlACE5Dj2YRGz_cnL0y9FYpBKK60DnUYHkcPw8zu4b-2Lg30Y66eETN68f_226BkGCkdluS6UsaCwiSwNS7nVSuopZ45a60VgMeW6o6C-LPdBEiejEraUnskooqucc4FCvZfQ5Rp8zBROOOMfN1iWPIn-janAWM0YV5sVDlLRzIZcJTpZLikbNvRIMW4rKkRZgPYsEr25KKpzSjNzC5wziP9Yw82qcbLzP3_UG-h6b5DjvW4G3URbYXkL7fTGOe5FX3sb2T28aPw8ptK0YRIk4wlOQUDzBRykDC2LfksrNifH0LH15wUGjwB3GXq_ruC5ZbPMUf4_sFnms3bRwEzBPavPHfThQnp6F23Du8I9hKkl1itT02Asq0UJdrcDaETJCbPBuhF6NiBAn3Z5SHT236TQHV404EVnvOhqhF4lkGzuTDnEc0GzOta9SNLRExFqH6rUKOu9scqX0kZiLNiYJVSyO4BG94Kt1WeIGaHnA-zOLv-9Sff_XdtjdBWQp98dTA8foGskY1-BCN9F2zBK4SG64r6t5-3qUZ5lGH26aAT-BpEKZEo
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+modified+inertial+proximal+minimization+algorithm+for+structured+nonconvex+and+nonsmooth+problem&rft.jtitle=Journal+of+inequalities+and+applications&rft.au=Xue%2C+Zhonghui&rft.au=Ma%2C+Qianfeng&rft.date=2024-09-20&rft.pub=Springer+Nature+B.V&rft.issn=1025-5834&rft.eissn=1029-242X&rft.volume=2024&rft.issue=1&rft.spage=124&rft_id=info:doi/10.1186%2Fs13660-024-03206-1&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1029-242X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1029-242X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1029-242X&client=summon