{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T09:17:31Z","timestamp":1722849451669},"reference-count":22,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T00:00:00Z","timestamp":1608508800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[2021,8]]},"abstract":"Abstract<\/jats:title>In this article, we present a reliable hybrid algorithm for solving convex quadratic minimization problems. At thek<\/jats:italic>th iteration, two points are computed: first, an auxiliary point is generated by performing a gradient step using an optimal steplength, and second, the next iteratex<\/jats:italic>k<\/jats:italic>\u2009+\u20091<\/jats:sub>is obtained by means of weighted sum of with the penultimate iteratex<\/jats:italic>k<\/jats:italic>\u2009\u2212\u20091<\/jats:sub>. The coefficient of the linear combination is computed by minimizing the residual norm along the line determined by the previous points. In particular, we adopt an optimal, nondelayed steplength in the first step and then use a smoothing technique to impose a delay on the scheme. Under a modest assumption, we show that our algorithm is Q\u2010linearly convergent to the unique solution of the problem. Finally, we report numerical experiments on strictly convex quadratic problems, showing that the proposed method is competitive in terms of CPU time and iterations with the conjugate gradient method.<\/jats:p>","DOI":"10.1002\/nla.2360","type":"journal-article","created":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T23:28:11Z","timestamp":1608593291000},"update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid gradient method for strictly convex quadratic programming"],"prefix":"10.1002","volume":"28","author":[{"given":"Harry","family":"Oviedo","sequence":"first","affiliation":[{"name":"Computer Science Department Mathematics Research Center, CIMAT A.C. Guanajuato Mexico"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1828-8458","authenticated-orcid":false,"given":"Oscar","family":"Dalmau","sequence":"additional","affiliation":[{"name":"Computer Science Department Mathematics Research Center, CIMAT A.C. Guanajuato Mexico"}]},{"given":"Rafael","family":"Herrera","sequence":"additional","affiliation":[{"name":"Computer Science Department Mathematics Research Center, CIMAT A.C. Guanajuato Mexico"}]}],"member":"311","published-online":{"date-parts":[[2020,12,21]]},"reference":[{"key":"e_1_2_10_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"e_1_2_10_3_1","volume-title":"Efficient reconstruction of 2D images and 3D surfaces","author":"Huang H","year":"2008"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611319.ch5"},{"key":"e_1_2_10_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396045"},{"key":"e_1_2_10_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S003614299427315X"},{"issue":"1847","key":"e_1_2_10_7_1","first-page":"536","article-title":"M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des systemes d\u00e9quations simultan\u00e9es","volume":"25","author":"Cauchy A","year":"1847","journal-title":"Comp Rend Sci Paris"},{"issue":"3","key":"e_1_2_10_8_1","first-page":"25","article-title":"Informational complexity and efficient methods for solving complex extremal problems","volume":"13","author":"Yudin D","year":"1977","journal-title":"Matekon"},{"key":"e_1_2_10_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(84)90234-9"},{"key":"e_1_2_10_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"e_1_2_10_11_1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.amc.2017.07.037","article-title":"On the steplength selection in gradient methods for unconstrained optimization","volume":"318","author":"Di Serafino D","year":"2018","journal-title":"Appl Math Comput"},{"key":"e_1_2_10_12_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v060.i03"},{"key":"e_1_2_10_13_1","first-page":"1","article-title":"Two novel gradient methods with optimal step sizes","author":"Oviedo H","year":"2019","journal-title":"J Comput Math"},{"key":"e_1_2_10_14_1","first-page":"271","article-title":"Hybrid methods for solving systems of equations","volume":"508","author":"Brezinski C","year":"1998","journal-title":"NATO ASI Ser C Math Phys Sci Adv Study Inst"},{"key":"e_1_2_10_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/01630569808816839"},{"key":"e_1_2_10_16_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.049.044"},{"key":"e_1_2_10_17_1","volume-title":"Numerical optimization","author":"Nocedal J","year":"2006"},{"key":"e_1_2_10_18_1","volume-title":"Linear and nonlinear programming","author":"Luenberger DG","year":"1984"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014897230089"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-019-00125-6"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2017.1399392"},{"key":"e_1_2_10_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-004-0569-y"},{"key":"e_1_2_10_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049670"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2360","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/nla.2360","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.2360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T10:09:01Z","timestamp":1698487741000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.2360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,21]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10.1002\/nla.2360"],"URL":"https:\/\/doi.org\/10.1002\/nla.2360","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12,21]]},"assertion":[{"value":"2020-02-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-25","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}