{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:34:18Z","timestamp":1787330058066,"version":"build-2736575974"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-16-1-0102"],"award-info":[{"award-number":["FA9550-16-1-0102"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2012585"],"award-info":[{"award-number":["2012585"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["2208518"],"award-info":[{"award-number":["2208518"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2023,10,31]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>We propose in this paper a new minimization algorithm based on a slightly modified version of the scalar auxialiary variable (SAV) approach coupled with a relaxation step and an adaptive strategy. It enjoys several distinct advantages over popular gradient based methods: (i) it is unconditionally energy diminishing with a modified energy which is intrinsically related to the original energy, and thus no parameter tuning is needed for stability; (ii) it allows the use of large step-sizes which can effectively accelerate the convergence rate. We also present a convergence analysis for some SAV based algorithms, which include our new algorithm without the relaxation step as a special case. We apply our new algorithm to several illustrative and benchmark problems and compare its performance with several popular gradient based methods. The numerical results indicate that the new algorithm is very robust, and its adaptive version usually converges significantly faster than those popular gradient decent based methods.<\/jats:p>","DOI":"10.1137\/23m1545744","type":"journal-article","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T04:41:05Z","timestamp":1695271265000},"page":"A2304-A2324","source":"Crossref","is-referenced-by-count":8,"title":["An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations"],"prefix":"10.1137","volume":"45","author":[{"given":"Xinyu","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Mathematics, Purdue University, West Lafayette, IN 47907 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4885-5732","authenticated-orcid":true,"given":"Jie","family":"Shen","sequence":"additional","affiliation":[{"name":"School of Mathematical Science, Eastern University of Technology, Ningbo, 315200, China, and Department of Mathematics, Purdue University, West Lafayette, IN 47907 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1090-7189","authenticated-orcid":true,"given":"Xiangxiong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Purdue University, West Lafayette, IN 47907 USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1966.16.1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1115\/1.3640537"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2022.01.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1443"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/151005099"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref7","volume-title":"Methods of Mathematical Physics: Partial Differential Equations","author":"Courant R.","year":"2008"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/10667"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0303013"},{"key":"ref10","unstructured":"Z. Guo , \nY. Xu , \nW. Yin , \nR. Jin , and \nT. Yang , A Novel Convergence Analysis for Algorithms of the Adam Family, preprint, arXiv:2112.03459, 2021."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/16M1072838"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/18M118640X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2022.110954"},{"key":"ref15","unstructured":"D. P. Kingma  and \nJ. Ba , Adam: A Method for Stochastic Optimization, preprint, arXiv:1412.6980, 2014."},{"key":"ref16","first-page":"543","volume":"269","author":"Nesterov Y.","year":"1983","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"ref17","series-title":"Appl. Optim. 87","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91578-4"},{"key":"ref19","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006"},{"key":"ref20","unstructured":"S. J. Osher , \nB. Wang , \nP. Yin , \nX. Luo , \nM. Pham , and \nA. T. Lin , Laplacian Smoothing Gradient Descent, http:\/\/arxiv.org\/abs\/1806.06317, 2018."},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"H. Robbins  and \nS. Monro , A stochastic approximation method, Ann. Math. Statist., 22 (1951), pp. 400\u2013407.","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref22","unstructured":"S. Ruder , An Overview of Gradient Descent Optimization Algorithms, preprint, arXiv:1609.04747, 2016."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/9781009160865"},{"key":"ref24","unstructured":"S. J. Reddi , \nS. Kale , and \nS. Kumar , On the convergence of Adam and beyond, in Proceedings of the International Conference on Learning Representations, 2018."},{"key":"ref25","volume":"353","author":"Shen J.","year":"2017","journal-title":"J. Comput. Phys."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/17M1150153"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1011036"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2016.09.029"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2022.111311"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2021.107331"},{"key":"ref31","unstructured":"S. Zheng , \nW. Huang , \nB. Vandereycken , and \nX. Zhang , Riemannian Optimization Using Three Different Metrics for Hermitian PSD Fixed-Rank Constraints: An Extended Version, preprint, arXiv:2204.07830, 2022."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2019.06.043"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/23M1545744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T15:46:04Z","timestamp":1787327164000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1545744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,21]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10,31]]}},"alternative-id":["10.1137\/23M1545744"],"URL":"https:\/\/doi.org\/10.1137\/23m1545744","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,21]]}}}