On three-term conjugate gradient algorithms for unconstrained optimization
This paper presents a project for three-term conjugate gradient algorithms development. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An...
Uložené v:
| Vydané v: | Applied mathematics and computation Ročník 219; číslo 11; s. 6316 - 6327 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.02.2013
|
| Predmet: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | This paper presents a project for three-term conjugate gradient algorithms development. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An example of three-term conjugate gradient algorithm from this class, as modifications of the classical and well known Hestenes and Stiefel or of the CG_DESCENT by Hager and Zhang conjugate gradient algorithms, satisfying both the descent and the conjugacy conditions is presented. These properties are independent of the line search. Also, the algorithm could be considered as a modification of the memoryless BFGS quasi-Newton method. The new approximation of the minimum is obtained by the general Wolfe line search and using by now a standard acceleration technique developed by Andrei. The proposed three-term conjugate gradient algorithm substantially outperforms the well known Hestenes and Stiefel conjugate gradient algorithm, as well as the more elaborated CG_DESCENT algorithm. A number of 5 applications from MINPACK-2 test problems collection, with 106 variables, prove that the suggested three-term conjugate gradient algorithm is top performer versus CG_DESCENT. |
|---|---|
| AbstractList | This paper presents a project for three-term conjugate gradient algorithms development. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An example of three-term conjugate gradient algorithm from this class, as modifications of the classical and well known Hestenes and Stiefel or of the CG_DESCENT by Hager and Zhang conjugate gradient algorithms, satisfying both the descent and the conjugacy conditions is presented. These properties are independent of the line search. Also, the algorithm could be considered as a modification of the memoryless BFGS quasi-Newton method. The new approximation of the minimum is obtained by the general Wolfe line search and using by now a standard acceleration technique developed by Andrei. The proposed three-term conjugate gradient algorithm substantially outperforms the well known Hestenes and Stiefel conjugate gradient algorithm, as well as the more elaborated CG_DESCENT algorithm. A number of 5 applications from MINPACK-2 test problems collection, with 106 variables, prove that the suggested three-term conjugate gradient algorithm is top performer versus CG_DESCENT. |
| Author | Andrei, Neculai |
| Author_xml | – sequence: 1 givenname: Neculai surname: Andrei fullname: Andrei, Neculai email: nandrei@ici.ro organization: Research Institute for Informatics, Center for Advanced Modeling and Optimization, 8-10, Averescu Avenue, Bucharest 1, Romania |
| BookMark | eNp9kL1OwzAURi1UJNrCA7BlZEnwjdM4EROq-FWlLt0t175pXSV2sV0keHpcysTQyR6-c6VzJmRknUVCboEWQKG-3xVyUEVJoSwACtryCzKGhrN8VlftiIwpbeucUcquyCSEHaWU11CNyfvSZnHrEfOIfsiUs7vDRkbMNl5qgzZmst84b-J2CFnnfHawaROil8aiztw-msF8y2icvSaXnewD3vy9U7J6flrNX_PF8uVt_rjIFWM05t2s5m1XNYrqTldc6abEkles5jUqoB20yNr1ugHUqu30uqJcsib9GjkDrtmU3J3O7r37OGCIYjBBYd9Li-4QBLCSlWXSrdIUTlPlXQgeO7H3ZpD-SwAVx2xiJ1I2ccwmAETKlhj-j1Em_vodnfuz5MOJxCT_adCLoFJBhdp4VFFoZ87QP6u8ivs |
| CitedBy_id | crossref_primary_10_1016_j_cam_2014_11_058 crossref_primary_10_1155_2018_5057096 crossref_primary_10_1080_10556788_2020_1843167 crossref_primary_10_12677_AAM_2022_117452 crossref_primary_10_1080_10556788_2017_1418870 crossref_primary_10_1016_j_amc_2015_07_067 crossref_primary_10_1007_s11075_015_0039_x crossref_primary_10_1155_2021_6219062 crossref_primary_10_1155_2014_394096 crossref_primary_10_1080_10556788_2018_1510926 crossref_primary_10_1186_s13660_016_1239_1 crossref_primary_10_1080_00207160_2017_1366457 crossref_primary_10_1155_2017_2715854 crossref_primary_10_1155_2017_7256769 crossref_primary_10_1080_02331934_2014_984706 crossref_primary_10_1002_nla_2577 crossref_primary_10_1007_s11075_014_9845_9 crossref_primary_10_1007_s00521_021_06383_y crossref_primary_10_1080_00207160_2013_862236 crossref_primary_10_1002_nla_2482 crossref_primary_10_1007_s10092_018_0258_3 crossref_primary_10_1007_s10957_014_0601_z crossref_primary_10_1080_02331934_2017_1295242 crossref_primary_10_1007_s10092_018_0298_8 crossref_primary_10_1007_s10957_018_1377_3 crossref_primary_10_1016_j_apnum_2015_01_008 |
| Cites_doi | 10.6028/jres.049.044 10.1016/0041-5553(69)90035-4 10.1080/01630560701749524 10.1080/10556789508805593 10.1016/j.amc.2009.03.020 10.1137/1011036 10.1137/S1052623497318992 10.1137/080743573 10.1137/1013035 10.1016/0045-7825(86)90073-3 10.1137/0715085 10.1007/BF00940464 10.1080/10556780701223293 10.1007/978-1-4612-4546-9 10.1093/imanum/drl016 10.2172/79972 10.1007/s10589-007-9055-7 10.1080/10556780600822260 10.1155/2009/243290 10.1007/BF01441967 10.1080/02331931003653187 10.1137/030601880 10.1007/BF00933447 10.1145/355666.355673 10.1093/comjnl/7.2.149 10.1007/s11075-006-9023-9 10.1007/s002450010019 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier Inc. |
| Copyright_xml | – notice: 2012 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D |
| DOI | 10.1016/j.amc.2012.11.097 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 6327 |
| ExternalDocumentID | 10_1016_j_amc_2012_11_097 S0096300312012908 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ACLOT ACRPL ACVFH ADCNI ADIYS ADMUD ADNMO AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HMJ HVGLF HZ~ R2- SEW TAE VH1 VOH WUQ ~HD 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-f5679f48c0dfd47cd82e2743676ec10f19e39bb81edc9fdb407a389fd8a517d3 |
| ISICitedReferencesCount | 53 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000314877500059&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0096-3003 |
| IngestDate | Sun Nov 09 10:31:21 EST 2025 Sat Nov 29 06:12:33 EST 2025 Tue Nov 18 21:59:31 EST 2025 Fri Feb 23 02:27:05 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Conjugacy condition Unconstrained optimization Three-term conjugate gradient Descent condition Numerical comparisons |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-f5679f48c0dfd47cd82e2743676ec10f19e39bb81edc9fdb407a389fd8a517d3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 1323220964 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1323220964 crossref_primary_10_1016_j_amc_2012_11_097 crossref_citationtrail_10_1016_j_amc_2012_11_097 elsevier_sciencedirect_doi_10_1016_j_amc_2012_11_097 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-02-01 |
| PublicationDateYYYYMMDD | 2013-02-01 |
| PublicationDate_xml | – month: 02 year: 2013 text: 2013-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2013 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Beale (b0050) 1972 B.M. Averick, R.G. Carter, J.J. Moré, G.L. Xue, The MINPACK-2 test problem collection. Mathematics and Computer Science Division, Argonne National Laboratory, Preprint MCS-P153-0692, June 1992. Andrei (b0025) 2008; 10 Cheng (b0060) 2007; 28 Andrei (b0015) 2007; 38 Fletcher, Reeves (b0090) 1964; 7 Nocedal (b0140) 1996 R. Fletcher, Practical Methods of Optimization, Volume 1: Unconstrained Optimization, John Wiley & Sons, New York, 1987. Andrei (b0010) 2006; 42 Andrei (b0030) 2009; 213 Al-Bayati, Sharif (b0005) 2010; 1 Goodman, Kohn, Reyna (b0100) 1986; 57 Zhang, Zhou (b0195) 2012; 14 Zhang, Zhou, Li (b0180) 2006; 26 Zhang, Zhou, Li (b0185) 2007; 22 Narushima, Yabe, Ford (b0125) 2011; 21 J. Bebernes, D. Eberly, Mahematical problems from combustion theory. in: Applied Mathematical Sciences 83, Springer-Verlag, 1989. Polyak (b0150) 1969; 9 Zoutendijk (b0200) 1970 Wolfe (b0175) 1971; 13 Dai, Liao (b0070) 2001; 43 Andrei (b0035) 2011; 60 J. Zhang, Y. Xiao, Z. Wei, Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization. Mathematical Problems in Engineering, vol. 2009 (2009), Article ID 243290. . R. Aris, The Mathematical Theory of Diffusion and Reaction in Permeable Catalysts, Oxford, 1975. M.J.D. Powell, Nonconvex minimization calculations and the conjugate gradient method. in: Numerical Analysis (Dundee, 1983), Lecture Notes in Mathematics, vol. 1066, Springer, Berlin, 1984, pp.122–141. Nitsche (b0135) 1989; 1 Cimatti (b0065) 1977; 3 Deng, Li (b0080) 1995; 4 Andrei (b0020) 2007; 22 Nazareth (b0130) 1977; 23 Hager, Zhang (b0105) 2005; 16 Dai, Yuan (b0075) 1999; 10 Glowinski (b0095) 1984 M.F. McGuire, P. Wolfe, Evaluating a restart procedure for conjugate gradients. Report RC-4382, IBM Research Center, Yorktown Heights, 1973. Shanno, Phua (b0165) 1976; 2 E. Polak, G. Ribière, Note sur la convergence de directions conjuguée, Rev. Francaise Informat Recherche Operationelle, 3e Année 16 (1969) 35–43. Shanno (b0160) 1978; 15 Liu, Storey (b0115) 1991; 69 Wolfe (b0170) 1968; 11 Hestenes, Stiefel (b0110) 1952; 49 10.1016/j.amc.2012.11.097_b0045 10.1016/j.amc.2012.11.097_b0145 10.1016/j.amc.2012.11.097_b0085 10.1016/j.amc.2012.11.097_b0120 Wolfe (10.1016/j.amc.2012.11.097_b0170) 1968; 11 Fletcher (10.1016/j.amc.2012.11.097_b0090) 1964; 7 Zhang (10.1016/j.amc.2012.11.097_b0180) 2006; 26 10.1016/j.amc.2012.11.097_b0040 Shanno (10.1016/j.amc.2012.11.097_b0160) 1978; 15 Andrei (10.1016/j.amc.2012.11.097_b0015) 2007; 38 Wolfe (10.1016/j.amc.2012.11.097_b0175) 1971; 13 Beale (10.1016/j.amc.2012.11.097_b0050) 1972 Zhang (10.1016/j.amc.2012.11.097_b0195) 2012; 14 Polyak (10.1016/j.amc.2012.11.097_b0150) 1969; 9 Zhang (10.1016/j.amc.2012.11.097_b0185) 2007; 22 Nitsche (10.1016/j.amc.2012.11.097_b0135) 1989; 1 Cimatti (10.1016/j.amc.2012.11.097_b0065) 1977; 3 Andrei (10.1016/j.amc.2012.11.097_b0035) 2011; 60 Glowinski (10.1016/j.amc.2012.11.097_b0095) 1984 Nocedal (10.1016/j.amc.2012.11.097_b0140) 1996 Andrei (10.1016/j.amc.2012.11.097_b0020) 2007; 22 Nazareth (10.1016/j.amc.2012.11.097_b0130) 1977; 23 Dai (10.1016/j.amc.2012.11.097_b0070) 2001; 43 Hager (10.1016/j.amc.2012.11.097_b0105) 2005; 16 10.1016/j.amc.2012.11.097_b0155 Zoutendijk (10.1016/j.amc.2012.11.097_b0200) 1970 Cheng (10.1016/j.amc.2012.11.097_b0060) 2007; 28 Deng (10.1016/j.amc.2012.11.097_b0080) 1995; 4 10.1016/j.amc.2012.11.097_b0055 Goodman (10.1016/j.amc.2012.11.097_b0100) 1986; 57 Andrei (10.1016/j.amc.2012.11.097_b0025) 2008; 10 Liu (10.1016/j.amc.2012.11.097_b0115) 1991; 69 Shanno (10.1016/j.amc.2012.11.097_b0165) 1976; 2 10.1016/j.amc.2012.11.097_b0190 Al-Bayati (10.1016/j.amc.2012.11.097_b0005) 2010; 1 Andrei (10.1016/j.amc.2012.11.097_b0030) 2009; 213 Narushima (10.1016/j.amc.2012.11.097_b0125) 2011; 21 Hestenes (10.1016/j.amc.2012.11.097_b0110) 1952; 49 Dai (10.1016/j.amc.2012.11.097_b0075) 1999; 10 Andrei (10.1016/j.amc.2012.11.097_b0010) 2006; 42 |
| References_xml | – volume: 28 start-page: 1217 year: 2007 end-page: 1230 ident: b0060 article-title: A two-term PRP-based descent method publication-title: Numer. Funct. Anal. Optim. – volume: 38 start-page: 401 year: 2007 end-page: 416 ident: b0015 article-title: Scaled conjugate gradient algorithms for unconstrained optimization publication-title: Comput. Optim. Appl. – reference: R. Fletcher, Practical Methods of Optimization, Volume 1: Unconstrained Optimization, John Wiley & Sons, New York, 1987. – volume: 16 start-page: 170 year: 2005 end-page: 192 ident: b0105 article-title: A new conjugate gradient method with guaranteed descent and an efficient line search publication-title: SIAM J. Optim. – volume: 9 start-page: 94 year: 1969 end-page: 112 ident: b0150 article-title: The conjugate gradient method in extreme problems publication-title: USSR Comput. Math. Math. Phys. – volume: 1 start-page: 108 year: 2010 end-page: 124 ident: b0005 article-title: A new three-term conjugate gradient method for unconstrained optimization publication-title: Can. J. Sci. Eng. Math. – year: 1984 ident: b0095 article-title: Numerical Methods for Nonlinear Variational Problems – volume: 49 start-page: 409 year: 1952 end-page: 436 ident: b0110 article-title: Methods of conjugate gradients for solving linear systems publication-title: J. Res. Nat. Bur. Stand. – reference: J. Bebernes, D. Eberly, Mahematical problems from combustion theory. in: Applied Mathematical Sciences 83, Springer-Verlag, 1989. – volume: 4 start-page: 273 year: 1995 end-page: 282 ident: b0080 article-title: Global convergence of three terms conjugate gradient methods publication-title: Optim. Methods Software – reference: J. Zhang, Y. Xiao, Z. Wei, Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization. Mathematical Problems in Engineering, vol. 2009 (2009), Article ID 243290. – reference: R. Aris, The Mathematical Theory of Diffusion and Reaction in Permeable Catalysts, Oxford, 1975. – volume: 22 start-page: 697 year: 2007 end-page: 711 ident: b0185 article-title: Some descent three-term conjugate gradient methods and their global convergence publication-title: Optim. Methods Software – start-page: 9 year: 1996 end-page: 23 ident: b0140 article-title: Conjugate gradient methods and nonlinear optimization publication-title: Linear and nonlinear Conjugate Gradient related methods – volume: 69 start-page: 129 year: 1991 end-page: 137 ident: b0115 article-title: Efficient generalized conjugate gradient algorithms, Part 1: Theory publication-title: JOTA – volume: 2 start-page: 87 year: 1976 end-page: 94 ident: b0165 article-title: Algorithm 500, minimization of unconstrained multivariate functions publication-title: ACM Trans. Math. Software – volume: 213 start-page: 361 year: 2009 end-page: 369 ident: b0030 article-title: Acceleration of conjugate gradient algorithms for unconstrained optimization publication-title: Appl. Math. Comput. – volume: 3 start-page: 227 year: 1977 end-page: 242 ident: b0065 article-title: On a problem of the theory of lubrication governed by a variational inequality publication-title: Appl. Math. Optim. – volume: 26 start-page: 629 year: 2006 end-page: 640 ident: b0180 article-title: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence publication-title: IMA J. Numer. Anal. – volume: 23 start-page: 373 year: 1977 end-page: 387 ident: b0130 article-title: A conjugate direction algorithm without line search publication-title: J. Optim. Theor. Appl. – start-page: 39 year: 1972 end-page: 43 ident: b0050 article-title: A derivative of conjugate gradients publication-title: Numerical Methods for Nonlinear Optimization – reference: M.J.D. Powell, Nonconvex minimization calculations and the conjugate gradient method. in: Numerical Analysis (Dundee, 1983), Lecture Notes in Mathematics, vol. 1066, Springer, Berlin, 1984, pp.122–141. – volume: 11 start-page: 226 year: 1968 end-page: 235 ident: b0170 article-title: Convergence conditions for ascent methods publication-title: SIAM Rev. – volume: 13 start-page: 185 year: 1971 end-page: 188 ident: b0175 article-title: Convergence conditions for ascent methods, (II): some corrections publication-title: SIAM Rev. – volume: 60 start-page: 1457 year: 2011 end-page: 1471 ident: b0035 article-title: A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization publication-title: Optimization – start-page: 38 year: 1970 end-page: 86 ident: b0200 article-title: Nonlinear programming, computational methods publication-title: Integer and Nonlinear Programming – volume: 42 start-page: 63 year: 2006 end-page: 73 ident: b0010 article-title: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization publication-title: Numer. Algorithms – volume: 10 start-page: 177 year: 1999 end-page: 182 ident: b0075 article-title: A nonlinear conjugate gradient method with a strong global convergence property publication-title: SIAM J. Optim. – volume: 43 start-page: 87 year: 2001 end-page: 101 ident: b0070 article-title: New conjugate conditions and related nonlinear conjugate gradient methods publication-title: Appl. Math. Optim. – volume: 10 start-page: 147 year: 2008 end-page: 161 ident: b0025 article-title: An unconstrained optimization test functions collection publication-title: Adv. Model. Opt. – volume: 15 start-page: 1247 year: 1978 end-page: 1257 ident: b0160 article-title: On the convergence of a new conjugate gradient algorithm publication-title: SIAM J. Numer. Anal. – volume: 14 start-page: 159 year: 2012 end-page: 163 ident: b0195 article-title: A note on the convergence properties of the original three-term Hestenes–Stiefel method publication-title: AMO – Adv. Model. Optim. – volume: 1 year: 1989 ident: b0135 publication-title: Lectures on Minimal Surfaces – reference: . – volume: 7 start-page: 149 year: 1964 end-page: 154 ident: b0090 article-title: Function minimization by conjugate gradients publication-title: Comput. J. – volume: 21 start-page: 212 year: 2011 end-page: 230 ident: b0125 article-title: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization publication-title: SIAM J. Optim. – reference: M.F. McGuire, P. Wolfe, Evaluating a restart procedure for conjugate gradients. Report RC-4382, IBM Research Center, Yorktown Heights, 1973. – reference: B.M. Averick, R.G. Carter, J.J. Moré, G.L. Xue, The MINPACK-2 test problem collection. Mathematics and Computer Science Division, Argonne National Laboratory, Preprint MCS-P153-0692, June 1992. – volume: 57 start-page: 107 year: 1986 end-page: 127 ident: b0100 article-title: Numerical study of a relaxed variational problem from optimal design publication-title: Comput. Methods Appl. Mech. Eng. – reference: E. Polak, G. Ribière, Note sur la convergence de directions conjuguée, Rev. Francaise Informat Recherche Operationelle, 3e Année 16 (1969) 35–43. – volume: 22 start-page: 561 year: 2007 end-page: 571 ident: b0020 article-title: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization publication-title: Optim. Methods Software – ident: 10.1016/j.amc.2012.11.097_b0155 – volume: 49 start-page: 409 year: 1952 ident: 10.1016/j.amc.2012.11.097_b0110 article-title: Methods of conjugate gradients for solving linear systems publication-title: J. Res. Nat. Bur. Stand. doi: 10.6028/jres.049.044 – volume: 9 start-page: 94 year: 1969 ident: 10.1016/j.amc.2012.11.097_b0150 article-title: The conjugate gradient method in extreme problems publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(69)90035-4 – volume: 28 start-page: 1217 year: 2007 ident: 10.1016/j.amc.2012.11.097_b0060 article-title: A two-term PRP-based descent method publication-title: Numer. Funct. Anal. Optim. doi: 10.1080/01630560701749524 – volume: 4 start-page: 273 year: 1995 ident: 10.1016/j.amc.2012.11.097_b0080 article-title: Global convergence of three terms conjugate gradient methods publication-title: Optim. Methods Software doi: 10.1080/10556789508805593 – volume: 1 start-page: 108 issue: 5 year: 2010 ident: 10.1016/j.amc.2012.11.097_b0005 article-title: A new three-term conjugate gradient method for unconstrained optimization publication-title: Can. J. Sci. Eng. Math. – volume: 213 start-page: 361 year: 2009 ident: 10.1016/j.amc.2012.11.097_b0030 article-title: Acceleration of conjugate gradient algorithms for unconstrained optimization publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2009.03.020 – ident: 10.1016/j.amc.2012.11.097_b0040 – volume: 10 start-page: 147 year: 2008 ident: 10.1016/j.amc.2012.11.097_b0025 article-title: An unconstrained optimization test functions collection publication-title: Adv. Model. Opt. – start-page: 39 year: 1972 ident: 10.1016/j.amc.2012.11.097_b0050 article-title: A derivative of conjugate gradients – ident: 10.1016/j.amc.2012.11.097_b0120 – volume: 11 start-page: 226 year: 1968 ident: 10.1016/j.amc.2012.11.097_b0170 article-title: Convergence conditions for ascent methods publication-title: SIAM Rev. doi: 10.1137/1011036 – volume: 10 start-page: 177 year: 1999 ident: 10.1016/j.amc.2012.11.097_b0075 article-title: A nonlinear conjugate gradient method with a strong global convergence property publication-title: SIAM J. Optim. doi: 10.1137/S1052623497318992 – ident: 10.1016/j.amc.2012.11.097_b0145 – volume: 21 start-page: 212 issue: 1 year: 2011 ident: 10.1016/j.amc.2012.11.097_b0125 article-title: A three-term conjugate gradient method with sufficient descent property for unconstrained optimization publication-title: SIAM J. Optim. doi: 10.1137/080743573 – volume: 13 start-page: 185 year: 1971 ident: 10.1016/j.amc.2012.11.097_b0175 article-title: Convergence conditions for ascent methods, (II): some corrections publication-title: SIAM Rev. doi: 10.1137/1013035 – volume: 57 start-page: 107 year: 1986 ident: 10.1016/j.amc.2012.11.097_b0100 article-title: Numerical study of a relaxed variational problem from optimal design publication-title: Comput. Methods Appl. Mech. Eng. doi: 10.1016/0045-7825(86)90073-3 – volume: 15 start-page: 1247 year: 1978 ident: 10.1016/j.amc.2012.11.097_b0160 article-title: On the convergence of a new conjugate gradient algorithm publication-title: SIAM J. Numer. Anal. doi: 10.1137/0715085 – volume: 69 start-page: 129 year: 1991 ident: 10.1016/j.amc.2012.11.097_b0115 article-title: Efficient generalized conjugate gradient algorithms, Part 1: Theory publication-title: JOTA doi: 10.1007/BF00940464 – volume: 1 year: 1989 ident: 10.1016/j.amc.2012.11.097_b0135 – volume: 22 start-page: 697 year: 2007 ident: 10.1016/j.amc.2012.11.097_b0185 article-title: Some descent three-term conjugate gradient methods and their global convergence publication-title: Optim. Methods Software doi: 10.1080/10556780701223293 – ident: 10.1016/j.amc.2012.11.097_b0055 doi: 10.1007/978-1-4612-4546-9 – start-page: 9 year: 1996 ident: 10.1016/j.amc.2012.11.097_b0140 article-title: Conjugate gradient methods and nonlinear optimization – volume: 26 start-page: 629 year: 2006 ident: 10.1016/j.amc.2012.11.097_b0180 article-title: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drl016 – year: 1984 ident: 10.1016/j.amc.2012.11.097_b0095 – ident: 10.1016/j.amc.2012.11.097_b0045 doi: 10.2172/79972 – start-page: 38 year: 1970 ident: 10.1016/j.amc.2012.11.097_b0200 article-title: Nonlinear programming, computational methods – volume: 38 start-page: 401 year: 2007 ident: 10.1016/j.amc.2012.11.097_b0015 article-title: Scaled conjugate gradient algorithms for unconstrained optimization publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-007-9055-7 – volume: 22 start-page: 561 year: 2007 ident: 10.1016/j.amc.2012.11.097_b0020 article-title: Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization publication-title: Optim. Methods Software doi: 10.1080/10556780600822260 – ident: 10.1016/j.amc.2012.11.097_b0085 – ident: 10.1016/j.amc.2012.11.097_b0190 doi: 10.1155/2009/243290 – volume: 3 start-page: 227 year: 1977 ident: 10.1016/j.amc.2012.11.097_b0065 article-title: On a problem of the theory of lubrication governed by a variational inequality publication-title: Appl. Math. Optim. doi: 10.1007/BF01441967 – volume: 60 start-page: 1457 year: 2011 ident: 10.1016/j.amc.2012.11.097_b0035 article-title: A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization publication-title: Optimization doi: 10.1080/02331931003653187 – volume: 16 start-page: 170 year: 2005 ident: 10.1016/j.amc.2012.11.097_b0105 article-title: A new conjugate gradient method with guaranteed descent and an efficient line search publication-title: SIAM J. Optim. doi: 10.1137/030601880 – volume: 23 start-page: 373 year: 1977 ident: 10.1016/j.amc.2012.11.097_b0130 article-title: A conjugate direction algorithm without line search publication-title: J. Optim. Theor. Appl. doi: 10.1007/BF00933447 – volume: 14 start-page: 159 year: 2012 ident: 10.1016/j.amc.2012.11.097_b0195 article-title: A note on the convergence properties of the original three-term Hestenes–Stiefel method publication-title: AMO – Adv. Model. Optim. – volume: 2 start-page: 87 year: 1976 ident: 10.1016/j.amc.2012.11.097_b0165 article-title: Algorithm 500, minimization of unconstrained multivariate functions publication-title: ACM Trans. Math. Software doi: 10.1145/355666.355673 – volume: 7 start-page: 149 year: 1964 ident: 10.1016/j.amc.2012.11.097_b0090 article-title: Function minimization by conjugate gradients publication-title: Comput. J. doi: 10.1093/comjnl/7.2.149 – volume: 42 start-page: 63 year: 2006 ident: 10.1016/j.amc.2012.11.097_b0010 article-title: An acceleration of gradient descent algorithm with backtracking for unconstrained optimization publication-title: Numer. Algorithms doi: 10.1007/s11075-006-9023-9 – volume: 43 start-page: 87 year: 2001 ident: 10.1016/j.amc.2012.11.097_b0070 article-title: New conjugate conditions and related nonlinear conjugate gradient methods publication-title: Appl. Math. Optim. doi: 10.1007/s002450010019 |
| SSID | ssj0007614 |
| Score | 2.2829947 |
| Snippet | This paper presents a project for three-term conjugate gradient algorithms development. The search direction of the algorithms from this class has three terms... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 6316 |
| SubjectTerms | Algorithms Approximation Computation Conjugacy condition Conjugate gradients Descent Descent condition Mathematical analysis Mathematical models Numerical comparisons Searching Three-term conjugate gradient Unconstrained optimization |
| Title | On three-term conjugate gradient algorithms for unconstrained optimization |
| URI | https://dx.doi.org/10.1016/j.amc.2012.11.097 https://www.proquest.com/docview/1323220964 |
| Volume | 219 |
| WOSCitedRecordID | wos000314877500059&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5BygEOiKdoechIiAOVK6_X8XqPFUoFVUg4BCm3lb2PNhFxgpNU_fnM2LuOU0RVDlwsy_JL861mv52d-YaQD3mimRa5DtPIFmHCeR4WMeuHFoVjEoHFlLXO7JCPRtl0Kr67bvbrup0AL8vs-lqs_ivUcA3AxtLZf4C7fSlcgHMAHY4AOxzvBPwYo_-VMSE6Xcwqn28xVHZ8UdXZXRjivVhWs81lI8VwDBMbckRsFQHkcwkuZOFqM7vE1bPVRSvzuvYlcavt_nZ-nSNZJwmM6s67s25kAbs8tFkazlsKzIuLWNdbeg_nhgXtOL-U0bQzkaasqfr_w0k38YL5Sb5ADUkan6CMapOluy-IPRrLsx_DoZwMppOPq18h9grDPXXXOOU-OYh5X2Q9cnD6dTA9b2dgnjaa7v7__W52ndd346t_4yM3ZuaabkyekMdunRCcNvg-JfdM-Yw8-raz_nNyPi6DHdJBi3TgkQ52SAeAdLCHdNBF-gWZnA0mn7-ErjVGqBiLNqHtp1zYJFORtjrhSmexiYEMpjw1ikaWCsNEUWTUaCWsLmDZngM1tTrL-5Rr9pL0ymVpXpFAUeBoCtYJMWMJt1mhMsCxKLCBFbUxPSSRt49UTjYef_Sn9PmBcwkmlWhSWE5KMOkh-dQ-smo0U267OfFGl470NWROwnC57bH3HiAJDhF3ufLSLLdrSRksEmKAPjm6wz2vycPd0H9Deptqa96SB-pqM1tX79zA-g3e14R1 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+three-term+conjugate+gradient+algorithms+for+unconstrained+optimization&rft.jtitle=Applied+mathematics+and+computation&rft.au=Andrei%2C+Neculai&rft.date=2013-02-01&rft.issn=0096-3003&rft.volume=219&rft.issue=11&rft.spage=6316&rft.epage=6327&rft_id=info:doi/10.1016%2Fj.amc.2012.11.097&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |