{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:50:55Z","timestamp":1790009455798,"version":"4.0.1"},"reference-count":22,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T00:00:00Z","timestamp":1536192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, a modification to the Polak\u2013Ribi\u00e9re\u2013Polyak (PRP) nonlinear conjugate gradient method is presented. The proposed method always generates a sufficient descent direction independent of the accuracy of the line search and the convexity of the objective function. Under appropriate conditions, the modified method is proved to possess global convergence under the Wolfe or Armijo-type line search. Moreover, the proposed methodology is adopted in the Hestenes\u2013Stiefel (HS) and Liu\u2013Storey (LS) methods. Extensive preliminary numerical experiments are used to illustrate the efficiency of the proposed method.<\/jats:p>","DOI":"10.3390\/a11090133","type":"journal-article","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T10:38:38Z","timestamp":1536230318000},"page":"133","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Modified Sufficient Descent Polak\u2013Ribi\u00e9re\u2013Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems"],"prefix":"10.3390","volume":"11","author":[{"given":"Xiuyun","family":"Zheng","sequence":"first","affiliation":[{"name":"School of Science, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4315-8655","authenticated-orcid":false,"given":"Jiarong","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Science, Xi\u2019an University of Architecture and Technology, Xi\u2019an 710055, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,9,6]]},"reference":[{"key":"ref_1","unstructured":"Dai, Y., and Yuan, Y. (2000). Nonlinear Conjugate Gradient Methods, Shanghai Scientific and Technical Publishers."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradient for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"ref_4","first-page":"35","article-title":"Note surla convergence des m\u00e8thodes de directions conjugu\u00e8es","volume":"3","author":"Polak","year":"1969","journal-title":"Rev. Fr. Inform. Rech. Oper."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","article-title":"The conjugate gradient method in extreme problems","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00940464","article-title":"Efficient generalized conjugate gradient algorithms. Part 1 Theory","volume":"69","author":"Liu","year":"1991","journal-title":"J. Optim. Theory Appl."},{"key":"ref_7","first-page":"35","article-title":"A survey of nonlinear conjugate gradient methods","volume":"2","author":"Hager","year":"2006","journal-title":"Pac. J. Optim."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0802003","article-title":"Global convergence properties of conjugate gradient methods for optimization","volume":"2","author":"Gibert","year":"1992","journal-title":"SIAM J. Optim."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/10556789308805532","article-title":"Analysis on the conjugate gradient method","volume":"2","author":"Yuan","year":"1993","journal-title":"Optim. Method Softw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/BFb0099521","article-title":"Nonconvex minimization calculations and the conjugate gradient method","volume":"1066","author":"Powell","year":"1984","journal-title":"Numer. Anal. Lect. Notes Math."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","article-title":"A new conjugate gradient method with guaranteed descent and an efficient line search","volume":"16","author":"Hager","year":"2005","journal-title":"SIAM J. Optim."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1080\/01630560701749524","article-title":"A Two-Term PRP-Based Descent Method","volume":"28","author":"Cheng","year":"2007","journal-title":"Numer. Func. Anal. Opt."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.3934\/jimo.2008.4.565","article-title":"Global convergence of modified Polak-Ribi\u00e9re-Polyak conjugate gradient methods with sufficient descent property","volume":"4","author":"Yu","year":"2008","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s11590-008-0086-5","article-title":"Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems","volume":"3","author":"Yuan","year":"2009","journal-title":"Optim. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.cam.2012.09.007","article-title":"A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization","volume":"239","author":"Livieris","year":"2013","journal-title":"J. Comput. Appl. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1016\/j.amc.2006.05.150","article-title":"The convergence properties of some new conjugate gradient methods","volume":"183","author":"Wei","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1016\/j.amc.2009.08.016","article-title":"An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation","volume":"215","author":"Zhang","year":"2009","journal-title":"Appl. Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1093\/imanum\/drl016","article-title":"A descent modified Polak-Ribi\u00e8re-Polyak conjugate gradient method and its global convergence","volume":"26","author":"Zhang","year":"2006","journal-title":"IMA J. Numer. Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3846\/13926292.2016.1176965","article-title":"A New Three-Term Conjugate Gradient Method with Descent Direction for Unconstrained Optimization","volume":"21","author":"Dong","year":"2016","journal-title":"Math. Model. Anal."},{"key":"ref_20","unstructured":"Abadie, J. (1970). Nonlinear Programming, Computational Methods. Ineger and Nonlinear Programming, North-Holland."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","article-title":"CUTE: Constrained and unconstrained testing environments","volume":"21","author":"Bongartz","year":"1995","journal-title":"ACM T. Math. Softw."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/9\/133\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:19:13Z","timestamp":1760195953000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/9\/133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,6]]},"references-count":22,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["a11090133"],"URL":"https:\/\/doi.org\/10.3390\/a11090133","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,6]]}}}