{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:51:07Z","timestamp":1780084267552,"version":"3.54.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:00:00Z","timestamp":1697673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1808978"],"award-info":[{"award-number":["DMS-1808978"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-2204519"],"award-info":[{"award-number":["DMS-2204519"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10957-023-02319-9","type":"journal-article","created":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T20:40:22Z","timestamp":1697748022000},"page":"2138-2178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Inexact Reduced Gradient Methods in Nonconvex Optimization"],"prefix":"10.1007","volume":"203","author":[{"given":"Pham Duy","family":"Khanh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boris S.","family":"Mordukhovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dat Ba","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,19]]},"reference":[{"key":"2319_CR1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"P-A Absil","year":"2005","unstructured":"Absil, P.-A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim. 16, 531\u2013547 (2005)","journal-title":"SIAM J. Optim."},{"key":"2319_CR2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10589-009-9261-6","volume":"48","author":"A Addis","year":"2011","unstructured":"Addis, A., Cassioli, A., Locatelli, M., Schoen, F.: A global optimization method for the design of space trajectories. Comput. Optim. Appl. 48, 635\u2013652 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"2319_CR3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"key":"2319_CR4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"2319_CR5","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems. An approach based on the Kurdyka\u2013\u0141ojasiewicz property. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"2319_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42, 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"2319_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Cham (2017)","edition":"2"},{"key":"2319_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"key":"2319_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"2319_CR10","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2016","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 3rd edn. Athena Scientific, Belmont (2016)","edition":"3"},{"key":"2319_CR11","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1137\/0901019","volume":"1","author":"P Bloomfield","year":"1980","unstructured":"Bloomfield, P., Steiger, W.: Least absolute deviations curve fitting. SIAM J. Sci. Stat. Comput. 1, 290\u2013301 (1980)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"2319_CR12","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2006","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17, 1205\u20131223 (2006)","journal-title":"SIAM J. Optim."},{"key":"2319_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60, 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"2319_CR14","first-page":"147","volume":"351\u2013352","author":"JV Burke","year":"2002","unstructured":"Burke, J.V., Lewis, A.S., Overton, M.L.: Two numerical methods for optimizing matrix stability. Linear Algebra Appl. 351\u2013352, 147\u2013184 (2002)","journal-title":"Linear Algebra Appl."},{"key":"2319_CR15","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s11228-021-00610-3","volume":"29","author":"JV Burke","year":"2021","unstructured":"Burke, J.V., Lin, Q.: Convergence of the gradient sampling algorithm on directionally Lipschitz functions. Set-Valued Var. Anal. 29, 949\u2013966 (2021)","journal-title":"Set-Valued Var. Anal."},{"key":"2319_CR16","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. MOS-SIAM Optimization Series, Philadelphia (2008)"},{"key":"2319_CR17","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2140\/pjm.1955.5.33","volume":"5","author":"JB Crockett","year":"1955","unstructured":"Crockett, J.B., Chernoff, H.: Gradient methods of maximization. Pac. J. Math. 5, 33\u201350 (1955)","journal-title":"Pac. J. Math."},{"key":"2319_CR18","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1090\/qam\/10667","volume":"2","author":"HB Curry","year":"1944","unstructured":"Curry, H.B.: The method of steepest descent for non-linear minimization problems. Q. Appl. Math. 2, 258\u2013261 (1944)","journal-title":"Q. Appl. Math."},{"key":"2319_CR19","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1080\/1055678021000049345","volume":"17","author":"H Dan","year":"2002","unstructured":"Dan, H., Yamashita, N., Fukushima, M.: Convergence properties of the inexact Levenberg\u2013Marquardt method under local error bound conditions. Optim. Methods Softw. 17, 605\u2013626 (2002)","journal-title":"Optim. Methods Softw."},{"key":"2319_CR20","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Yu.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146, 37\u201375 (2014)","journal-title":"Math. Program."},{"key":"2319_CR21","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, New York (2003)"},{"key":"2319_CR22","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/s10107-021-01665-8","volume":"194","author":"O Gannot","year":"2022","unstructured":"Gannot, O.: A frequency-domain analysis of inexact gradient methods. Math. Program. 194, 975\u20131016 (2022)","journal-title":"Math. Program."},{"key":"2319_CR23","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/0805015","volume":"5","author":"P Gilmore","year":"1995","unstructured":"Gilmore, P., Kelley, C.T.: An implicit filtering algorithm for optimization of functions with many local minima. SIAM J. Optim. 5, 269\u2013285 (1995)","journal-title":"SIAM J. Optim."},{"key":"2319_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-04247-3","volume-title":"Newton-Type Methods for Optimization and Variational Problems","author":"AF Izmailov","year":"2014","unstructured":"Izmailov, A.F., Solodov, M.V.: Newton-Type Methods for Optimization and Variational Problems. Springer, New York (2014)"},{"key":"2319_CR25","first-page":"150","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M.: A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 4, 150\u2013194 (2013)","journal-title":"Int. J. Math. Model. Numer. Optim."},{"key":"2319_CR26","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013\u0141ojasiewicz condition. In: Frasconi, P. et al. (eds.) Joint European Conference on Machine Learning and Knowledge Discovery in Databases, Lecture Notes in Computer Science, Part\u00a01. Springer, Cham, pp. 795\u2013811 (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"2319_CR27","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10898-022-01248-7","volume":"86","author":"PD Khanh","year":"2023","unstructured":"Khanh, P.D., Mordukhovich, B.S., Phat, V.T., Tran, D.B.: Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials. J. Glob. Optim. 86, 93\u2013122 (2023)","journal-title":"J. Glob. Optim."},{"key":"2319_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-023-01980-2","author":"PD Khanh","year":"2023","unstructured":"Khanh, P.D., Mordukhovich, B.S., Phat, V.T., Tran, D.B.: Globally convergent coderivative-based generalized Newton methods in nonsmooth optimizations. Math. Program. (2023). https:\/\/doi.org\/10.1007\/s10107-023-01980-2","journal-title":"Math. Program."},{"key":"2319_CR29","unstructured":"Khanh, P.D., Mordukhovich, B.S., Phat, V.T., Tran, D.B.: A new inexact gradient descent method with applications to nonsmooth convex optimization. arXiv:2303.08785"},{"key":"2319_CR30","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1137\/050639673","volume":"18","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: Convergence of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 18, 379\u2013388 (2007)","journal-title":"SIAM J. Optim."},{"key":"2319_CR31","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1137\/090748408","volume":"20","author":"KC Kiwiel","year":"2010","unstructured":"Kiwiel, K.C.: A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization. SIAM J. Optim. 20, 1983\u20131994 (2010)","journal-title":"SIAM J. Optim."},{"key":"2319_CR32","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10957-009-9584-6","volume":"144","author":"KC Kiwiel","year":"2010","unstructured":"Kiwiel, K.C.: Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization. J. Optim. Theory Appl. 144, 69\u201375 (2010)","journal-title":"J. Optim. Theory Appl."},{"key":"2319_CR33","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 48, 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier"},{"key":"2319_CR34","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10208-008-9036-y","volume":"9","author":"AS Lewis","year":"2009","unstructured":"Lewis, A.S., Luke, D.R., Malick, J.: Local linear convergence for alternating and averaged nonconvex projections. Found. Comput. Math. 9, 485\u2013513 (2009)","journal-title":"Found. Comput. Math."},{"key":"2319_CR35","doi-asserted-by":"crossref","unstructured":"Lobanov, A., Gasnikov, A., Stonyakin, F.: Highly smoothness zero-order methods for solving optimization problems under PL condition. arXiv:2305.15828 (2023)","DOI":"10.1134\/S0965542524700118"},{"key":"2319_CR36","volume-title":"Ensembles Semi-analytiques","author":"S \u0141ojasiewicz","year":"1965","unstructured":"\u0141ojasiewicz, S.: Ensembles Semi-analytiques. Institut des Hautes Etudes Scientifiques, Bures-sur-Yvette (Seine-et-Oise) (1965)"},{"key":"2319_CR37","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Yu Nesterov","year":"2015","unstructured":"Nesterov, Yu.: Universal gradient methods for convex optimization problems. Math. Program. 152, 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"2319_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Yu Nesterov","year":"2018","unstructured":"Nesterov, Yu.: Lectures on Convex Optimization, 2nd edn. Springer, Cham (2018)","edition":"2"},{"key":"2319_CR39","volume-title":"Neural Networks and Deep Learning","author":"MA Nielsen","year":"2015","unstructured":"Nielsen, M.A.: Neural Networks and Deep Learning. Determination Press, New York (2015)"},{"key":"2319_CR40","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2016","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2016)","edition":"2"},{"key":"2319_CR41","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s10957-013-0391-8","volume":"160","author":"D Noll","year":"2014","unstructured":"Noll, D.: Convergence of non-smooth descent methods using the Kurdyka\u2013\u0141ojasiewicz inequality. J. Optim. Theory Appl. 160, 553\u2013572 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"2319_CR42","volume-title":"Solution of Equations and Systems of Equations","author":"A Ostrowski","year":"1966","unstructured":"Ostrowski, A.: Solution of Equations and Systems of Equations, 2nd edn. Academic Press, New York (1966)","edition":"2"},{"key":"2319_CR43","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for minimizing functionals. USSR Comput. Math. Math. Phys. 3, 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"2319_CR44","first-page":"147","volume-title":"Iterative Algorithms for Singular Minimization Problems. Nonlinear Programming","author":"BT Polyak","year":"1981","unstructured":"Polyak, B.T.: Iterative Algorithms for Singular Minimization Problems. Nonlinear Programming, vol. 4, pp. 147\u2013166. Academic Press, London (1981)"},{"key":"2319_CR45","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"2319_CR46","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control. Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control. Optim."},{"key":"2319_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"2319_CR48","doi-asserted-by":"publisher","unstructured":"Rotaru, T., Glineur, F., Patrinos, P.: Tight convergence rates of the gradient method on hypoconvex functions. https:\/\/doi.org\/10.48550\/arXiv.2203.00775","DOI":"10.48550\/arXiv.2203.00775"},{"key":"2319_CR49","doi-asserted-by":"publisher","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. https:\/\/doi.org\/10.48550\/arXiv:1609.04747","DOI":"10.48550\/arXiv:1609.04747"},{"key":"2319_CR50","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"A Themelis","year":"2017","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67, 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"2319_CR51","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2023.2212503","author":"A Vasin","year":"2023","unstructured":"Vasin, A., Gasnikov, A., Dvurechensky, P., Spokoiny, V.: Accelerated gradient methods with absolute and relative noise in the gradient. Optim. Methods Softw. (2023). https:\/\/doi.org\/10.1080\/10556788.2023.2212503","journal-title":"Optim. Methods Softw."},{"key":"2319_CR52","doi-asserted-by":"publisher","unstructured":"Xingyu, Z.: On the Fenchel duality between strong convexity and Lipschitz continuous gradient. https:\/\/doi.org\/10.48550\/arXiv.1803.06573","DOI":"10.48550\/arXiv.1803.06573"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02319-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02319-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02319-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T19:07:36Z","timestamp":1733771256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02319-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,19]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2319"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02319-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,19]]},"assertion":[{"value":"12 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}