Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems

Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the classical scheme by Dai and Yuan [Soc. Ind. Appl. Math., 10(1)(1999) 177-182], two modified DY search directions are obtained, which possess...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical sciences (Karaj, Iran) Ročník 18; číslo 4; s. 707 - 728
Hlavní autoři: Ahmed, Kabiru, Waziri, Mohammed Yusuf, Halilu, Abubakar Sani, Sabi’u, Jamilu, Murtala, Salisu, Abdullahi, Habibu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2024
Springer Nature B.V
Témata:
Algorithms
Applications of Mathematics
Constraints
Convergence
Eigenvalues
Mathematics
Mathematics and Statistics
Methods
Nonlinear systems
Optimization
Original Research
Parameter modification
Conjugacy condition
Projection operator
Convex set
90C30
Non-smooth functions
Backtracking technique
Descent condition
90C26
94A12
ISSN:2008-1359, 2251-7456
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 Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the classical scheme by Dai and Yuan [Soc. Ind. Appl. Math., 10(1)(1999) 177-182], two modified DY search directions are obtained, which possess the vital property for analyzing global convergence. By conducting eigenvalue analysis, appropriate values were obtained for the nonnegative parameter C of the two schemes. The self-restarting structure of the first scheme, as well as the choices of the parameter C in both methods, ensure fast convergence to the solution of the problems considered. Algorithms of both schemes are implemented by employing monotone line search procedure by Zhang and Zhou [J. Comput. Appl. Math. 196(2006) 478-484] and the projection technique. Using fundamental assumptions, global convergence of both schemes is established and results of numerical experiments with four recent methods in the literature show that the new methods are encouraging.
AbstractList Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the classical scheme by Dai and Yuan [Soc. Ind. Appl. Math., 10(1)(1999) 177-182], two modified DY search directions are obtained, which possess the vital property for analyzing global convergence. By conducting eigenvalue analysis, appropriate values were obtained for the nonnegative parameter C of the two schemes. The self-restarting structure of the first scheme, as well as the choices of the parameter C in both methods, ensure fast convergence to the solution of the problems considered. Algorithms of both schemes are implemented by employing monotone line search procedure by Zhang and Zhou [J. Comput. Appl. Math. 196(2006) 478-484] and the projection technique. Using fundamental assumptions, global convergence of both schemes is established and results of numerical experiments with four recent methods in the literature show that the new methods are encouraging.
Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the classical scheme by Dai and Yuan [Soc. Ind. Appl. Math., 10(1)(1999) 177-182], two modified DY search directions are obtained, which possess the vital property for analyzing global convergence. By conducting eigenvalue analysis, appropriate values were obtained for the nonnegative parameter C of the two schemes. The self-restarting structure of the first scheme, as well as the choices of the parameter C in both methods, ensure fast convergence to the solution of the problems considered. Algorithms of both schemes are implemented by employing monotone line search procedure by Zhang and Zhou [J. Comput. Appl. Math. 196(2006) 478-484] and the projection technique. Using fundamental assumptions, global convergence of both schemes is established and results of numerical experiments with four recent methods in the literature show that the new methods are encouraging.
Author Halilu, Abubakar Sani
Abdullahi, Habibu
Murtala, Salisu
Ahmed, Kabiru
Waziri, Mohammed Yusuf
Sabi’u, Jamilu
Author_xml – sequence: 1
  givenname: Kabiru
  orcidid: 0000-0003-4868-976X
  surname: Ahmed
  fullname: Ahmed, Kabiru
  organization: Numerical Optimization Research Group, Bayero University, Department of Mathematical Sciences, Bayero University
– sequence: 2
  givenname: Mohammed Yusuf
  orcidid: 0000-0001-7112-659X
  surname: Waziri
  fullname: Waziri, Mohammed Yusuf
  organization: Numerical Optimization Research Group, Bayero University, Department of Mathematical Sciences, Bayero University
– sequence: 3
  givenname: Abubakar Sani
  orcidid: 0000-0002-9680-266X
  surname: Halilu
  fullname: Halilu, Abubakar Sani
  organization: Department of Mathematics, Sule Lamido University, Numerical Optimization Research Group, Bayero University
– sequence: 4
  givenname: Jamilu
  surname: Sabi’u
  fullname: Sabi’u, Jamilu
  organization: Numerical Optimization Research Group, Bayero University, Department of Mathematics, North-West University
– sequence: 5
  givenname: Salisu
  orcidid: 0000-0001-5268-3665
  surname: Murtala
  fullname: Murtala, Salisu
  organization: Numerical Optimization Research Group, Bayero University, Department of Mathematics, Federal University
– sequence: 6
  givenname: Habibu
  surname: Abdullahi
  fullname: Abdullahi, Habibu
  email: habibu.abdullahi@slu.edu.ng
  organization: Department of Mathematics, Sule Lamido University, Numerical Optimization Research Group, Bayero University
BookMark eNp9kEtLAzEUhYNUsNb-AVcDrqM3r8nMUuqrUHBjF65COnNHp3SSmkyL_ntTRxBcNJsbwvlyzznnZOS8Q0IuGVwzAH0TJUCZU-CSAiieU31CxpwrRrVU-SjdAQrKhCrPyDTGNaSjdQlSjcly3m2D32Od3dmWvu6sy9oeg-3bPWaxescOY9b4kFXe7fHzMGIfbOsS0Xnn-2QlS3426cWGLH7FHrt4QU4bu4k4_Z0Tsny4f5k90cXz43x2u6CVUEVPNeNaYwO15lqUWJTWStsUvAFRr7iVkkGlcyskFE2OpRKqrm2t6xWgXhW4EhNyNfybMnzsMPZm7XfBpZVGMKlKLgRAUhWDqgo-xoCNqdo-JfTukGRjGJhDj2bo0aQezU-PRieU_0O3oe1s-DoOiQGKSezeMPy5OkJ9A0xPiEs
CitedBy_id crossref_primary_10_46481_jnsps_2025_2569
Cites_doi 10.1016/j.cam.2004.02.013
10.4208/jcm.1412-m4494
10.3934/jimo.2010.6.149
10.1007/s41980-018-0163-1
10.3336/gm.52.2.12
10.1007/s11075-019-00836-1
10.55937/sut/1424782608
10.1016/j.cam.2010.01.052
10.1090/S0025-5718-1965-0198670-6
10.6028/jres.049.044
10.1007/s40314-021-01624-1
10.1007/s40065-018-0206-8
10.1007/s40314-022-01917-z
10.1007/s10092-019-0312-9
10.22436/jmcs.026.04.01
10.1007/s40065-019-0264-6
10.1142/S0219876220500437
10.1080/02331934.2023.2187255
10.1016/j.apnum.2021.03.005
10.3934/jimo.2016017
10.1016/j.aml.2007.05.002
10.1007/978-1-4757-6388-1_18
10.1016/j.mcm.2009.04.007
10.1080/10556780701661344
10.1137/100813026
10.1016/0041-5553(69)90035-4
10.1108/EC-06-2021-0317
10.1137/0111030
10.1007/s11075-015-9961-1
10.3390/sym14071401
10.3934/naco.2021044
10.1002/nla.2583
10.1137/S1052623499357957
10.1007/s10589-006-6444-2
10.1007/s11075-018-0603-2
10.11113/mjfas.v15n2019.1085
10.1016/j.cam.2021.114035
10.1007/s11075-023-01678-8
10.1007/s10092-018-0291-2
10.1145/1132973.1132979
10.2306/scienceasia1513-1874.2021.018
10.1080/10556788.2014.966825
10.1016/j.matcom.2021.03.020
10.1007/s40324-020-00228-9
10.1080/10556789508805619
10.1109/CSO.2012.53
10.1587/transinf.2018EDP7210
10.1007/PL00005464
10.22436/jmcs.025.03.07
10.1007/s101070100263
10.1080/10556788.2013.833199
10.1051/ro/2021190
10.1016/j.camwa.2015.09.014
10.17535/crorr.2018.0006
10.1016/j.ejco.2023.100057
10.1137/030601880
10.1007/s10915-021-01713-7
10.1016/j.cnsns.2024.108079
10.1007/s40863-022-00293-0
10.3934/jimo.2013.9.117
10.1093/comjnl/7.2.149
10.1080/02331939708844339
10.1137/0723046
10.1016/j.cam.2005.10.002
10.1007/s10957-023-02281-6
10.1090/qam/10666
10.1080/02331934.2020.1778689
10.1007/BF00940464
10.1016/j.jmaa.2013.04.017
10.1287/opre.26.6.1073
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Islamic Azad University 2024 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Copyright Springer Nature B.V. Dec 2024
Copyright_xml – notice: The Author(s), under exclusive licence to Islamic Azad University 2024 Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: Copyright Springer Nature B.V. Dec 2024
DBID AAYXX
CITATION
8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.1007/s40096-024-00526-7
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
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
DatabaseTitle CrossRef
Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: ProQuest - Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2251-7456
EndPage 728
ExternalDocumentID 10_1007_s40096_024_00526_7
GroupedDBID -A0
0R~
2VQ
406
40G
5VS
8FE
8FG
AACDK
AAHNG
AAJBT
AASML
AATNV
AAUYE
ABAKF
ABECU
ABJCF
ABJNI
ABMQK
ABSXP
ABTEG
ABTKH
ABTMW
ACAOD
ACDTI
ACGFS
ACHSB
ACIPV
ACOKC
ACPIV
ACZOJ
ADBBV
ADINQ
ADKNI
ADYFF
AEFQL
AEMSY
AESKC
AFBBN
AFKRA
AFQWF
AGMZJ
AGQEE
AHBYD
AHSBF
AHYZX
AIGIU
AILAN
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMXSW
AMYLF
BCNDV
BENPR
BGLVJ
C24
C6C
CCPQU
DPUIP
EBLON
FIGPU
FNLPD
GGCAI
GROUPED_DOAJ
H13
HCIFZ
HG6
IAO
IKXTQ
IPNFZ
ITC
IWAJR
J9A
JZLTJ
KQ8
L6V
LLZTM
M7S
M~E
NPVJJ
NQJWS
OK1
PIMPY
PROAC
PT4
PTHSS
RIG
ROL
RSV
SJYHP
SMT
SNE
SNPRN
SOHCF
SOJ
SRMVM
SSLCW
UOJIU
UTJUX
ZMTXR
AAYXX
ABBRH
ABDBE
ABFSG
ACSTC
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c358t-71277ef0d72739e89aa4af82f03db2a4410c76a3408f6e9535ddad7db0e7b8eb3
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001371143400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2008-1359
IngestDate Wed Nov 05 09:00:46 EST 2025
Tue Nov 18 20:47:24 EST 2025
Sat Nov 29 07:44:53 EST 2025
Fri Feb 21 02:36:19 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Conjugacy condition
Projection operator
Convex set
90C30
Non-smooth functions
Backtracking technique
Descent condition
90C26
94A12
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c358t-71277ef0d72739e89aa4af82f03db2a4410c76a3408f6e9535ddad7db0e7b8eb3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7112-659X
0000-0003-4868-976X
0000-0002-9680-266X
0000-0001-5268-3665
OpenAccessLink https://www.proquest.com/docview/3145923300?pq-origsite=%requestingapplication%
PQID 3145923300
PQPubID 2034691
PageCount 22
ParticipantIDs proquest_journals_3145923300
crossref_citationtrail_10_1007_s40096_024_00526_7
crossref_primary_10_1007_s40096_024_00526_7
springer_journals_10_1007_s40096_024_00526_7
PublicationCentury 2000
PublicationDate 20241200
2024-12-00
20241201
PublicationDateYYYYMMDD 2024-12-01
PublicationDate_xml – month: 12
  year: 2024
  text: 20241200
PublicationDecade 2020
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
– name: Heidelberg
PublicationTitle Mathematical sciences (Karaj, Iran)
PublicationTitleAbbrev Math Sci
PublicationYear 2024
Publisher Springer Berlin Heidelberg
Springer Nature B.V
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer Nature B.V
References 526_CR98
YH Dai (526_CR28) 2013; 23
L Zhang (526_CR92) 2006; 196
WW Hager (526_CR45) 2006; 32
N Sharma (526_CR14) 2022; 25
R Ali (526_CR16) 2022; 26
MK Dauda (526_CR7) 2019; 15
N Andrei (526_CR21) 2011; 34
K Meintjes (526_CR1) 1987; 22
AS Halilu (526_CR73) 2022; 39
526_CR90
S Mompati (526_CR58) 2018; 7
GH Yu (526_CR55) 2013; 9
N Andrei (526_CR19) 2008; 17
K Ahmed (526_CR38) 2023; 200
A Perry (526_CR60) 1978; 26
G Yu (526_CR83) 2008; 23
G Fasano (526_CR9) 2006; 34
H Cao (526_CR33) 2021; 47
MY Waziri (526_CR78) 2023; 13
J Liu (526_CR48) 2018
ED Dolan (526_CR42) 2002; 91
BT Polak (526_CR61) 1969; 4
BT Polyak (526_CR40) 1969; 9
MY Waziri (526_CR68) 2019; 361
K Ahmed (526_CR75) 2024; 96
526_CR31
W Xue (526_CR87) 2018; 101
L Grippo (526_CR43) 1986; 23
M Koorapetse (526_CR52) 2018; 45
J Sabi’u (526_CR69) 2020
HI Ahmed (526_CR20) 2012; 53
E Polak (526_CR62) 1969; 16
MY Waziri (526_CR77) 2022; 407
MY Waziri (526_CR70) 2020
W Zhou (526_CR94) 2015; 261
WW Hager (526_CR46) 2006; 2
JK Liu (526_CR54) 2015; 70
J Liu (526_CR50) 2012; 2012
MR Arazm (526_CR22) 2017; 52
S Babaie-Kafaki (526_CR23) 2010; 234
IE Livieris (526_CR56) 2012; 218
G Yu (526_CR88) 2010; 6
MY Waziri (526_CR79) 2022; 16
S Babaie-Kafaki (526_CR17) 2015; 30
S Babaie-Kafaki (526_CR24) 2013; 29
JK Liu (526_CR86) 2015; 33
MY Waziri (526_CR81) 2021
A Althobaiti (526_CR34) 2022; 14
MY Waziri (526_CR85) 2020; 78
526_CR8
W Cheng (526_CR27) 2009; 50
CG Broyden (526_CR6) 1965; 19
MR Hestenes (526_CR37) 1952; 49
PT Gao (526_CR59) 2018; 55
M Koorapetse (526_CR36) 2021; 165
K Ahmed (526_CR82) 2023
E Nermeh (526_CR97) 2024; 136
MY Waziri (526_CR67) 2020; 9
J Liu (526_CR49) 2017; 13
Y Liu (526_CR32) 1991; 69
K Muangchoo (526_CR15) 2022; 25
Z Zhu (526_CR95) 2020; 373
L Han (526_CR47) 2008; 201
K Ahmed (526_CR76) 2023; 73
526_CR65
G Yu (526_CR89) 2011; 7
YH Dai (526_CR26) 1999; 10
YB Zhao (526_CR5) 2001; 11
526_CR64
N Andrei (526_CR18) 2008; 21
MY Waziri (526_CR71) 2022; 90
AS Halilu (526_CR72) 2021; 40
W Sun (526_CR66) 2006
C Kanzow (526_CR11) 2004; 172
WW Hager (526_CR44) 2005; 16
K Ahmed (526_CR74) 2024
Y Narushima (526_CR91) 2014; 50
XQ Zhou (526_CR93) 2016; 33
Z Aminifard (526_CR25) 2019; 56
K Amini (526_CR51) 2015; 70
DH Li (526_CR10) 2000; 37
SP Dirkse (526_CR2) 1995; 5
DW Marquardt (526_CR13) 1963; 11
Y Xiao (526_CR3) 2013; 405
AS Halilu (526_CR96) 2021
DH Li (526_CR53) 2000; 13
PT Gao (526_CR35) 2023; 13
MY Waziri (526_CR80) 2022; 41
R Fletcher (526_CR30) 1964; 7
YH Dai (526_CR57) 2001; 89
E Polak (526_CR39) 1969; 16
K Levenberg (526_CR12) 1944; 2
VM Solodov (526_CR4) 1997; 41
MY Waziri (526_CR84) 2020; 85
YH Dai (526_CR29) 2000
X Dong (526_CR41) 2010; 31
AK Shiker (526_CR63) 2018; 9
References_xml – volume: 172
  start-page: 375
  year: 2004
  ident: 526_CR11
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2004.02.013
– volume: 33
  start-page: 341
  year: 2015
  ident: 526_CR86
  publication-title: J. Comput. Math.
  doi: 10.4208/jcm.1412-m4494
– volume: 6
  start-page: 149
  year: 2010
  ident: 526_CR88
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2010.6.149
– volume: 45
  start-page: 755
  issue: 3
  year: 2018
  ident: 526_CR52
  publication-title: Bull. Iranian Math. Soc.
  doi: 10.1007/s41980-018-0163-1
– volume: 52
  start-page: 361
  issue: 72
  year: 2017
  ident: 526_CR22
  publication-title: Glasnik matematic
  doi: 10.3336/gm.52.2.12
– volume: 85
  start-page: 763
  year: 2020
  ident: 526_CR84
  publication-title: Numer. Algor.
  doi: 10.1007/s11075-019-00836-1
– volume: 31
  start-page: 1
  issue: 1
  year: 2010
  ident: 526_CR41
  publication-title: J. Numer. Methods Comput. Appl.
– volume: 50
  start-page: 167
  issue: 2
  year: 2014
  ident: 526_CR91
  publication-title: SUT J. Math.
  doi: 10.55937/sut/1424782608
– volume: 234
  start-page: 1374
  issue: 5
  year: 2010
  ident: 526_CR23
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2010.01.052
– volume: 19
  start-page: 577
  year: 1965
  ident: 526_CR6
  publication-title: Math. Comput.
  doi: 10.1090/S0025-5718-1965-0198670-6
– volume: 218
  start-page: 9197
  year: 2012
  ident: 526_CR56
  publication-title: Appl. Math. Comput.
– volume: 49
  start-page: 409
  year: 1952
  ident: 526_CR37
  publication-title: J. Res. Nat. Bur. Stand.
  doi: 10.6028/jres.049.044
– volume: 40
  start-page: 239
  year: 2021
  ident: 526_CR72
  publication-title: Comput. Appl. Math.
  doi: 10.1007/s40314-021-01624-1
– volume: 16
  start-page: 35
  year: 1969
  ident: 526_CR39
  publication-title: Rev Francaise Informat Recherche Operationelle 3e Ann‘ ee
– volume: 7
  start-page: 289
  issue: 4
  year: 2018
  ident: 526_CR58
  publication-title: Arab. J. Math.
  doi: 10.1007/s40065-018-0206-8
– volume: 41
  start-page: 1
  issue: 232
  year: 2022
  ident: 526_CR80
  publication-title: Comput. Appl. Math.
  doi: 10.1007/s40314-022-01917-z
– volume: 10
  start-page: 177
  issue: 1
  year: 1999
  ident: 526_CR26
  publication-title: Soc. Indust. Appl. Math.
– volume: 56
  start-page: 1
  issue: 16
  year: 2019
  ident: 526_CR25
  publication-title: Calcolo
  doi: 10.1007/s10092-019-0312-9
– volume: 26
  start-page: 322
  issue: 4
  year: 2022
  ident: 526_CR16
  publication-title: J. Math. Comput. SCI-JM.
  doi: 10.22436/jmcs.026.04.01
– volume: 9
  start-page: 443
  year: 2020
  ident: 526_CR67
  publication-title: Arab. J. Math.
  doi: 10.1007/s40065-019-0264-6
– year: 2020
  ident: 526_CR69
  publication-title: Int. J. Comput. Methods
  doi: 10.1142/S0219876220500437
– volume: 73
  start-page: 1949
  year: 2023
  ident: 526_CR76
  publication-title: Optimization
  doi: 10.1080/02331934.2023.2187255
– volume: 165
  start-page: 431
  year: 2021
  ident: 526_CR36
  publication-title: Appl. Numer. Math.
  doi: 10.1016/j.apnum.2021.03.005
– volume: 22
  start-page: 333
  year: 1987
  ident: 526_CR1
  publication-title: Appl. Math. Comput.
– ident: 526_CR65
– volume: 13
  start-page: 583
  year: 2000
  ident: 526_CR53
  publication-title: Optim. Methods Softw.
– volume: 13
  start-page: 283
  issue: 1
  year: 2017
  ident: 526_CR49
  publication-title: J. Indust. Manag. Optim.
  doi: 10.3934/jimo.2016017
– volume: 21
  start-page: 165
  year: 2008
  ident: 526_CR18
  publication-title: Appl. Math. Lett.
  doi: 10.1016/j.aml.2007.05.002
– ident: 526_CR8
  doi: 10.1007/978-1-4757-6388-1_18
– volume: 261
  start-page: 1
  year: 2015
  ident: 526_CR94
  publication-title: Appl. Math. Comput.
– volume: 33
  start-page: 6
  issue: 3
  year: 2016
  ident: 526_CR93
  publication-title: J. Chongq. Normal Univ. (Nat. Sci. Edition)
– volume: 50
  start-page: 15
  year: 2009
  ident: 526_CR27
  publication-title: Math. Comput. Modell.
  doi: 10.1016/j.mcm.2009.04.007
– volume: 23
  start-page: 275
  issue: 2
  year: 2008
  ident: 526_CR83
  publication-title: Optim. Methods Soft.
  doi: 10.1080/10556780701661344
– volume: 23
  start-page: 296
  year: 2013
  ident: 526_CR28
  publication-title: SIAM J. Optim.
  doi: 10.1137/100813026
– volume: 2
  start-page: 35
  issue: 1
  year: 2006
  ident: 526_CR46
  publication-title: Pac. J. Optim.
– volume: 9
  start-page: 94
  year: 1969
  ident: 526_CR40
  publication-title: USSR Comp. Math. Math. Phys.
  doi: 10.1016/0041-5553(69)90035-4
– volume: 17
  start-page: 373
  issue: 4
  year: 2008
  ident: 526_CR19
  publication-title: Stud. Inform. Control.
– volume: 39
  start-page: 1802
  year: 2022
  ident: 526_CR73
  publication-title: Eng. Comput.
  doi: 10.1108/EC-06-2021-0317
– volume: 11
  start-page: 431
  year: 1963
  ident: 526_CR13
  publication-title: SIAM J. Appl. Math.
  doi: 10.1137/0111030
– volume: 70
  start-page: 559
  issue: 3
  year: 2015
  ident: 526_CR51
  publication-title: Numer. Alg.
  doi: 10.1007/s11075-015-9961-1
– volume: 14
  start-page: 1401
  year: 2022
  ident: 526_CR34
  publication-title: Symmetry
  doi: 10.3390/sym14071401
– volume: 7
  start-page: 387
  year: 2011
  ident: 526_CR89
  publication-title: Pac. J. Optim.
– volume: 13
  start-page: 53
  year: 2023
  ident: 526_CR78
  publication-title: Numer. Algebra Control Optim.
  doi: 10.3934/naco.2021044
– year: 2024
  ident: 526_CR74
  publication-title: Numer. Linear Algebra Appl.
  doi: 10.1002/nla.2583
– volume: 11
  start-page: 962
  year: 2001
  ident: 526_CR5
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623499357957
– volume: 34
  start-page: 343
  year: 2006
  ident: 526_CR9
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-006-6444-2
– ident: 526_CR64
  doi: 10.1007/978-1-4757-6388-1_18
– ident: 526_CR31
– volume: 37
  start-page: 152
  year: 2000
  ident: 526_CR10
  publication-title: SIAM J. Numer. Anal.
– volume: 16
  start-page: 35
  year: 1969
  ident: 526_CR62
  publication-title: Rev. Fr. Inform. Rech. Oper.
– year: 2018
  ident: 526_CR48
  publication-title: Numer. Alg.
  doi: 10.1007/s11075-018-0603-2
– volume: 4
  start-page: 94
  year: 1969
  ident: 526_CR61
  publication-title: USSR Comput. Math. Math. Phys.
  doi: 10.1016/0041-5553(69)90035-4
– volume: 15
  start-page: 117
  year: 2019
  ident: 526_CR7
  publication-title: Mal. J. Fund. Appl. Sci.
  doi: 10.11113/mjfas.v15n2019.1085
– volume: 407
  year: 2022
  ident: 526_CR77
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2021.114035
– ident: 526_CR98
– volume: 96
  start-page: 1583
  issue: 4
  year: 2024
  ident: 526_CR75
  publication-title: Numer. Algor.
  doi: 10.1007/s11075-023-01678-8
– volume: 55
  start-page: 53
  year: 2018
  ident: 526_CR59
  publication-title: Calcolo
  doi: 10.1007/s10092-018-0291-2
– volume: 32
  start-page: 113
  issue: 1
  year: 2006
  ident: 526_CR45
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/1132973.1132979
– volume: 53
  start-page: 620
  issue: 3
  year: 2012
  ident: 526_CR20
  publication-title: Iraqi J. Sci.
– volume: 47
  start-page: 235
  year: 2021
  ident: 526_CR33
  publication-title: ScienceAsia
  doi: 10.2306/scienceasia1513-1874.2021.018
– volume: 2012
  year: 2012
  ident: 526_CR50
  publication-title: J. Appl. Math.
– volume: 30
  start-page: 673
  issue: 4
  year: 2015
  ident: 526_CR17
  publication-title: Optim. Methods Soft.
  doi: 10.1080/10556788.2014.966825
– volume-title: Nonlinear conjugate gradient methods
  year: 2000
  ident: 526_CR29
– year: 2021
  ident: 526_CR96
  publication-title: Math. Comput. Simul.
  doi: 10.1016/j.matcom.2021.03.020
– volume: 78
  start-page: 15
  year: 2020
  ident: 526_CR85
  publication-title: SeMA J.
  doi: 10.1007/s40324-020-00228-9
– volume: 5
  start-page: 319
  year: 1995
  ident: 526_CR2
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556789508805619
– ident: 526_CR90
  doi: 10.1109/CSO.2012.53
– volume: 101
  start-page: 2984
  issue: 12
  year: 2018
  ident: 526_CR87
  publication-title: IEICE Trans. Inf. and Syst.
  doi: 10.1587/transinf.2018EDP7210
– volume: 89
  start-page: 83
  year: 2001
  ident: 526_CR57
  publication-title: Numer. Math.
  doi: 10.1007/PL00005464
– volume-title: Optimization Theory and Methods: Nonlinear Programming
  year: 2006
  ident: 526_CR66
– volume: 25
  start-page: 284
  issue: 3
  year: 2022
  ident: 526_CR14
  publication-title: J. Math. Comput. SCI-JM.
  doi: 10.22436/jmcs.025.03.07
– volume: 91
  start-page: 201
  issue: 2
  year: 2002
  ident: 526_CR42
  publication-title: Math. Program.
  doi: 10.1007/s101070100263
– volume: 201
  start-page: 621
  year: 2008
  ident: 526_CR47
  publication-title: Appl. Math. Comput.
– volume: 34
  start-page: 319
  issue: 2
  year: 2011
  ident: 526_CR21
  publication-title: Bull. Malays. Math. Sci. Soc.
– volume: 29
  start-page: 583
  issue: 3
  year: 2013
  ident: 526_CR24
  publication-title: Optim. Methods Soft.
  doi: 10.1080/10556788.2013.833199
– volume: 361
  start-page: 645
  year: 2019
  ident: 526_CR68
  publication-title: Appl. Math. Comput.
– year: 2021
  ident: 526_CR81
  publication-title: Rairo Oper. Research
  doi: 10.1051/ro/2021190
– volume: 70
  start-page: 2442
  issue: 10
  year: 2015
  ident: 526_CR54
  publication-title: Comput. Math. Appl.
  doi: 10.1016/j.camwa.2015.09.014
– volume: 9
  start-page: 63
  year: 2018
  ident: 526_CR63
  publication-title: Croat. Oper. Research Review.
  doi: 10.17535/crorr.2018.0006
– year: 2023
  ident: 526_CR82
  publication-title: Euro J. Comput. Optim.
  doi: 10.1016/j.ejco.2023.100057
– volume: 16
  start-page: 170
  issue: 1
  year: 2005
  ident: 526_CR44
  publication-title: SIAM J. Optim.
  doi: 10.1137/030601880
– volume: 90
  start-page: 53
  issue: 36
  year: 2022
  ident: 526_CR71
  publication-title: J. Sci. Comput.
  doi: 10.1007/s10915-021-01713-7
– volume: 136
  year: 2024
  ident: 526_CR97
  publication-title: Commun. Nonlinear Sci. Numer. Simul.
  doi: 10.1016/j.cnsns.2024.108079
– volume: 16
  start-page: 957
  year: 2022
  ident: 526_CR79
  publication-title: São Paulo J. Math. Sci.
  doi: 10.1007/s40863-022-00293-0
– volume: 9
  start-page: 117
  issue: 1
  year: 2013
  ident: 526_CR55
  publication-title: J. Ind. Manag. Optim.
  doi: 10.3934/jimo.2013.9.117
– volume: 7
  start-page: 149
  year: 1964
  ident: 526_CR30
  publication-title: Comput. J.
  doi: 10.1093/comjnl/7.2.149
– volume: 41
  start-page: 257
  issue: 3
  year: 1997
  ident: 526_CR4
  publication-title: Optim.
  doi: 10.1080/02331939708844339
– volume: 23
  start-page: 707
  year: 1986
  ident: 526_CR43
  publication-title: SIAM J. Numer. Anal.
  doi: 10.1137/0723046
– volume: 196
  start-page: 478
  year: 2006
  ident: 526_CR92
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2005.10.002
– volume: 200
  start-page: 669
  year: 2023
  ident: 526_CR38
  publication-title: J. Optim. Theory Appl.
  doi: 10.1007/s10957-023-02281-6
– volume: 13
  start-page: 2006
  issue: 4
  year: 2023
  ident: 526_CR35
  publication-title: J. Appl. Anal. Comput.
– volume: 373
  issue: 2020
  year: 2020
  ident: 526_CR95
  publication-title: Appl. Math. Comput.
– volume: 2
  start-page: 164
  year: 1944
  ident: 526_CR12
  publication-title: Q. Appl. Math.
  doi: 10.1090/qam/10666
– year: 2020
  ident: 526_CR70
  publication-title: Optimization
  doi: 10.1080/02331934.2020.1778689
– volume: 69
  start-page: 129
  year: 1991
  ident: 526_CR32
  publication-title: J. Optim Theory Appl.
  doi: 10.1007/BF00940464
– volume: 405
  start-page: 310
  year: 2013
  ident: 526_CR3
  publication-title: J. Math. Anal. Appl.
  doi: 10.1016/j.jmaa.2013.04.017
– volume: 25
  start-page: 115
  issue: 2
  year: 2022
  ident: 526_CR15
  publication-title: J. Math. Comput. SCI-JM.
– volume: 26
  start-page: 1073
  issue: 6
  year: 1978
  ident: 526_CR60
  publication-title: Oper. Res. Tech. Notes
  doi: 10.1287/opre.26.6.1073
SSID ssj0000779045
Score 2.2755392
Snippet Two new Dai-Yuan (DY) iterative schemes are presented in this article for solving constrained system of nonlinear monotone equations. Using an extension of the...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 707
SubjectTerms Algorithms
Applications of Mathematics
Constraints
Convergence
Eigenvalues
Mathematics
Mathematics and Statistics
Methods
Nonlinear systems
Optimization
Original Research
Parameter modification
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB609aAH32K1Sg7eNJh9JnsSHy0etBSxUE9LNg8oaFu7rfjzTbJpi4JePO1hNw8y2ZkvM5NvAM6ozqTONMeC8hTHQSFwYQwXllGsQkJ1mihXteSBdjqs38-63uFW-rTKuU50ilqOhPWRX0ZBnBgwEhFyNX7HtmqUja76EhqrULdMZXEN6jetTvdp4WUhlk7PVSp2cf4gSjJ_c8bdn4stgsfGTGHHe4Lpd-u0hJw_oqTO-LS3_jvtbdj0sBNdV_tkB1bUcBc2HhecreUe9Cr_gpLojg_wy4wPUUW5bPQhMmdg9aZKZCAuconqn_ZRugITpoUZZWRZvdGwYt7gE1RRRJf70Gu3nm_vsS-6gEWUsCmmQUip0kRaYJMplnEec81CTSJZhNygJyJoyqOYMJ2qLIkSKbmksiCKFswczQ-gZsZSh4C0DhULgoKlhdETknClOcsoZ4JqkSRpA4L5YufCM5Lbeb_mCy5lJ6DcCCh3AsppA84XbcYVH8efXzfnUsn9v1nmS5E04GIu1-Xr33s7-ru3Y1gP7VZyuS5NqE0nM3UCa-JjOignp35nfgE1Pen5
  priority: 102
  providerName: ProQuest
Title Improved Dai-Yuan iterative schemes for convex constrained monotone nonlinear systems
URI https://link.springer.com/article/10.1007/s40096-024-00526-7
https://www.proquest.com/docview/3145923300
Volume 18
WOSCitedRecordID wos001371143400001&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: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 2251-7456
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000779045
  issn: 2008-1359
  databaseCode: M7S
  dateStart: 20120501
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest - Publicly Available Content Database
  customDbUrl:
  eissn: 2251-7456
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000779045
  issn: 2008-1359
  databaseCode: PIMPY
  dateStart: 20120501
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2251-7456
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000779045
  issn: 2008-1359
  databaseCode: BENPR
  dateStart: 20120501
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 2251-7456
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000779045
  issn: 2008-1359
  databaseCode: RSV
  dateStart: 20121201
  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/eLvHCXMwnV1LSwMxEB60etCDb7FaSw7eNJB9Jnv00aJgS2mttKclu0mgoFW6rfjzTbKPoqigp2XZJBtmksyXzOQbgDOqIqEixXFKeYh9J0lxog0XFp4vXUJVGEibteSedrtsNIp6xaWwrIx2L12SdqWuLrv5Bm5jbVOwJSnBdBXWtLljZjr2B4_VyQoxFHo2O7H17TteEBW3Zb5v5rNFWsLML55Ra3Da2__r6g5sFQATXeYjYhdW5HQPNjsVO2u2D8P8JEEKdMMneLzgU5STK-uVD-ndrnyWGdJgFtmQ9HfzyGwqCV1Dj9oXw9-NpjnHBp-hnAw6O4Bhu_VwfYuL9Ao49QI2x9RxKZWKCANhIskizn2umKuIJxKXa5xEUhpyzydMhTIKvEAILqhIiKQJ05vwQ6jpf8kjQEq5kjlOwsJErwiCcKk4iyhnKVVpEIR1cEoRx2nBPW76_RRXrMlWZLEWWWxFFtM6nFd1XnPmjV9LN0rNxcUszGLP8QMNYD1C6nBRamr5-efWjv9W_AQ2XKNsG-XSgNp8tpCnsJ6-zSfZrAlrV61ur980YaUD_da76_TGTTtmPwBsG-MQ
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB7RpVLpASil6gIFH9oTWDhPOweEEA-xYne1B5DglDp-SEh0gc0C7Z_iNzJ2kl1RCW4cOOWQ2Injz_Py-BuAn9xm2mZWUsVlSuOgULRAxUV1FJuQcZsmxlct6fJ-X5yfZ4MZeGzOwri0ykYmekGtr5WLkW9HQZygMRIxtntzS13VKLe72pTQqGBxYv49oMtW7nQOcH5_heHR4en-Ma2rClAVJWJMeRBybizTTnNnRmRSxtKK0LJIF6FE84ApnsooZsKmJkuiRGupuS6Y4YVA3xP7_QCzMYJdtGB20OkNLiZRHebo-3xlZJ9XEERJVp_U8ef1YucxUFSL1POsUP5cG05N3P92Zb2yO1p4b79pEeZrs5rsVevgC8yY4RJ87k04acuvcFbFT4wmB_KSXtzJIakopVHeE_TxzR9TEjThiU_E_-supS-ggS1wVNeOtZwMK2YROSIVBXa5DGdvMq5v0MJ3me9ArA2NCIJCpAXKQc2ksVJkXArFrUqStA1BM7m5qhnX3Xdf5ROuaA-IHAGRe0DkvA2bkzY3Fd_Iq0-vNSjIa9lT5lMItGGrwdH09su9rbze2wZ8Oj7tdfNup3-yCnOhg7HP61mD1nh0Z37AR3U_vixH6_WqIPD7rRH2BGhDSA8
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9swFH_qYJrYYewDtLKy-cBOw8L5tHNACK1UQy0V0lapOwXHHxISa7umbPCv8dfx7CStNmncOOyUQ2Injn9-X37-PYA9bjNtMyup4jKlcVAoWqDiojqKTci4TRPjq5YM-HAoxuPsvAV3zVkYl1bZyEQvqPVUuRj5QRTECRojEWMHtk6LOO_2jmY_qasg5XZam3IaFUT65vY3um_l4WkX5_pjGPZOvn3-QusKA1RFiVhQHoScG8u00-KZEZmUsbQitCzSRSjRVGCKpzKKmbCpyZIo0VpqrgtmeCHQD8V-n8A6j9FO8GmDX5fxHeaI_HyNZJ9hEERJVp_Z8Sf3Yuc7UFSQ1DOuUP6nXlwZu3_tz3q119v8n3_YS3hRG9vkuFodr6BlJq_h-dmSqbZ8A6MqqmI06cpL-v1aTkhFNI1agKDnb36YkqBhT3x6_o27lL6sBrbAUU0dlzmZVHwjck4qYuxyC0aPMq5tWMN3mbdArA2NCIJCpAVKR82ksVJkXArFrUqStA1BM9G5qnnY3Xdf5UsGaQ-OHMGRe3DkvA2flm1mFQvJg093GkTktUQq8xUc2rDfYGp1-9-97Tzc2wd4hrDKB6fD_jvYCB2ifbJPB9YW82uzC0_Vr8VlOX_vlweBi8eG1z2XKk9W
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=Improved+Dai-Yuan+iterative+schemes+for+convex+constrained+monotone+nonlinear+systems&rft.jtitle=Mathematical+sciences+%28Karaj%2C+Iran%29&rft.au=Ahmed%2C+Kabiru&rft.au=Waziri%2C+Mohammed+Yusuf&rft.au=Halilu%2C+Abubakar+Sani&rft.au=Sabi%E2%80%99u%2C+Jamilu&rft.date=2024-12-01&rft.issn=2008-1359&rft.eissn=2251-7456&rft.volume=18&rft.issue=4&rft.spage=707&rft.epage=728&rft_id=info:doi/10.1007%2Fs40096-024-00526-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s40096_024_00526_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2008-1359&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2008-1359&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2008-1359&client=summon