{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T22:25:38Z","timestamp":1792794338033,"version":"4.5.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T00:00:00Z","timestamp":1677888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T00:00:00Z","timestamp":1677888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271127"],"award-info":[{"award-number":["12271127"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176073"],"award-info":[{"award-number":["62176073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2021YFA1003500"],"award-info":[{"award-number":["2021YFA1003500"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2022FRFK0600XX"],"award-info":[{"award-number":["2022FRFK0600XX"]}],"id":[{"id":"10.13039\/501100012226","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":[[2023,5]]},"DOI":"10.1007\/s10957-023-02176-6","type":"journal-article","created":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T11:02:32Z","timestamp":1677927752000},"page":"539-572","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Smoothing Accelerated Proximal Gradient Method with Fast Convergence Rate for Nonsmooth Convex Optimization Beyond Differentiability"],"prefix":"10.1007","volume":"197","author":[{"given":"Fan","family":"Wu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4252-047X","authenticated-orcid":false,"given":"Wei","family":"Bian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,4]]},"reference":[{"issue":"3","key":"2176_CR1","doi-asserted-by":"crossref","first-page":"2134","DOI":"10.1137\/19M1307779","volume":"30","author":"S Adly","year":"2020","unstructured":"Adly, S., Attouch, H.: Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping. SIAM J. Optim. 30(3), 2134\u20132162 (2020)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2176_CR2","doi-asserted-by":"crossref","first-page":"1281","DOI":"10.1080\/02331934.2019.1696337","volume":"69","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Cabot, A.: Convergence rate of a relaxed inertial proximal algorithm for convex minimization. Optimization 69(6), 1281\u20131312 (2020)","journal-title":"Optimization"},{"key":"2176_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01591-1","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Chbani, Z., Fadili, J., Riahi, H.: First-order optimization algorithms via inertial systems with Hessian driven damping. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01591-1","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2176_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1\u20132), 123\u2013175 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"2176_CR5","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1137\/18M1230207","volume":"29","author":"H Attouch","year":"2019","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Fast proximal methods via time scaling of damped inertial dynamics. SIAM J. Optim. 29(3), 2227\u20132256 (2019)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2176_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10013-020-00399-y","volume":"48","author":"H Attouch","year":"2020","unstructured":"Attouch, H., Chbani, Z., Riahi, H.: Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients. Vietnam J. Math. 48(2), 247\u2013276 (2020)","journal-title":"Vietnam J. Math."},{"issue":"3","key":"2176_CR7","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$1\/k^{2}$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2176_CR8","doi-asserted-by":"crossref","first-page":"2408","DOI":"10.1137\/140994964","volume":"25","author":"JF Aujol","year":"2015","unstructured":"Aujol, J.F., Dossal, C.: Stability of over-relaxations for the forward\u2013backward algorithm, application to FISTA. SIAM J. Optim. 25(4), 2408\u20132433 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2176_CR9","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(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2176_CR10","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/17M1116544","volume":"28","author":"A Beck","year":"2018","unstructured":"Beck, A., Hallak, N.: Proximal mapping for symmetric penalty and sparsity. SIAM J. Optim. 28(1), 496\u2013527 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2176_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10107-018-1277-1","volume":"178","author":"A Beck","year":"2019","unstructured":"Beck, A., Hallak, N.: Optimization problems involving group sparsity terms. Math. Program. 178(1\u20132), 39\u201367 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"2176_CR12","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(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"165","key":"2176_CR13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Cand\u00e8s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3(165), 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"issue":"12","key":"2176_CR14","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1360\/SSM-2020-0181","volume":"50","author":"W Bian","year":"2020","unstructured":"Bian, W.: Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems (in Chinese). Sci. Sin. Math. 50(12), 1651\u20131666 (2020)","journal-title":"Sci. Sin. Math."},{"issue":"1","key":"2176_CR15","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/18M1186009","volume":"58","author":"W Bian","year":"2020","unstructured":"Bian, W., Chen, X.: A smoothing proximal gradient algorithm for nonsmooth convex regression with cardinality penalty. SIAM J. Numer. Anal. 58(1), 858\u2013883 (2020)","journal-title":"SIAM J. Numer. Anal."},{"key":"2176_CR16","doi-asserted-by":"publisher","unstructured":"Bo\u0163, R.I., B$$\\ddot{\\rm o}$$hm, A.: Variable smoothing for convex optimization problems using stochastic gradients. J. Sci. Comput. 85(33) (2020). https:\/\/doi.org\/10.1007\/s10915-020-01332-8","DOI":"10.1007\/s10915-020-01332-8"},{"issue":"1","key":"2176_CR17","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/s11750-014-0326-z","volume":"23","author":"RI Bo\u0163","year":"2015","unstructured":"Bo\u0163, R.I., Hendrich, C.: A variable smoothing algorithm for solving convex optimization problems. TOP 23(1), 124\u2013150 (2015)","journal-title":"TOP"},{"issue":"1","key":"2176_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"2176_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0022-247X(77)90152-4","volume":"61","author":"RE Bruck Jr","year":"1977","unstructured":"Bruck, R.E., Jr.: On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space. J. Math. Anal. Appl. 61(1), 159\u2013164 (1977)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"2176_CR20","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"EJ Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"2176_CR21","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20(1\u20132), 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"issue":"3","key":"2176_CR22","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the \u201cfast iterative shrinkage\/thresholding algorithm\u2019\u2019. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2176_CR23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"issue":"4","key":"2176_CR24","doi-asserted-by":"crossref","first-page":"A2174","DOI":"10.1137\/17M1116714","volume":"40","author":"X Chen","year":"2018","unstructured":"Chen, X., Kelley, C.T., Xu, F., Zhang, Z.: A smoothing direct search method for Monte Carlo-based bound constrained composite nonsmooth optimization. SIAM J. Sci. Comput. 40(4), A2174\u2013A2199 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"2176_CR25","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"2009","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Springer, Berlin (2009)"},{"issue":"4","key":"2176_CR26","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2176_CR27","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2007","unstructured":"Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, Berlin (2007)"},{"issue":"456","key":"2176_CR28","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"2176_CR29","first-page":"819","volume":"42","author":"J Fan","year":"2014","unstructured":"Fan, J., Xue, L., Zou, H.: Strong oracle optimality of folded concave penalized estimation. Ann. Stat. 42(3), 819 (2014)","journal-title":"Ann. Stat."},{"issue":"8","key":"2176_CR30","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8), 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"2176_CR31","doi-asserted-by":"crossref","unstructured":"G$$\\ddot{\\rm u}$$ler, O.: New proximal point algorithms for convex minimization. SIAM J. Optim. 2(4), 649\u2013664 (1992)","DOI":"10.1137\/0802032"},{"issue":"2","key":"2176_CR32","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/moor.1100.0452","volume":"35","author":"S Hoda","year":"2010","unstructured":"Hoda, S., Gilpin, A., Pena, J., Sandholm, T.: Smoothing techniques for computing Nash equilibria of sequential games. Math. Oper. Res. 35(2), 494\u2013512 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1\u20132","key":"2176_CR33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong, M., Luo, Z.Q.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162(1\u20132), 165\u2013199 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"2176_CR34","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1257\/jep.15.4.143","volume":"15","author":"R Koenker","year":"2001","unstructured":"Koenker, R., Hallock, K.F.: Quantile regression. J. Econ. Perspect. 15(4), 143\u2013156 (2001)","journal-title":"J. Econ. Perspect."},{"issue":"1\u20132","key":"2176_CR35","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Ma, S., Dai, Y., Zhang, S.: A smoothing SQP framework for a class of composite $${L}_q$$ minimization over polyhedron. Math. Program. 158(1\u20132), 467\u2013500 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2176_CR36","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-013-0714-4","volume":"147","author":"Z Lu","year":"2014","unstructured":"Lu, Z.: Iterative hard thresholding methods for $$\\ell _0$$ regularized convex cone programming. Math. Program. 147(1\u20132), 125\u2013154 (2014)","journal-title":"Math. Program."},{"key":"2176_CR37","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with the convergence rate $${O} (1\/k^{2})$$. Dokl. Akad. Nauk SSSR 269, 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2176_CR38","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekon. Mat. Metody 24, 509\u2013517 (1988)","journal-title":"Ekon. Mat. Metody"},{"issue":"1","key":"2176_CR39","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"2176_CR40","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer, Berlin (2006)"},{"issue":"4","key":"2176_CR41","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1090\/S0002-9904-1967-11761-0","volume":"73","author":"Z Opial","year":"1967","unstructured":"Opial, Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73(4), 591\u2013597 (1967)","journal-title":"Bull. Am. Math. Soc."},{"issue":"3","key":"2176_CR42","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"issue":"2","key":"2176_CR43","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72(2), 383\u2013390 (1979)","journal-title":"J. Math. Anal. Appl."},{"key":"2176_CR44","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (2009)"},{"issue":"3","key":"2176_CR45","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10589-016-9873-6","volume":"66","author":"Q Tran-Dinh","year":"2017","unstructured":"Tran-Dinh, Q.: Adaptive smoothing algorithms for nonsmooth composite convex minimization. Comput. Optim. Appl. 66(3), 425\u2013451 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"2176_CR46","volume-title":"Convex Analysis and Minimization Algorithms","author":"JBH Urruty","year":"1996","unstructured":"Urruty, J.B.H., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms. Springer, Berlin (1996)"},{"key":"2176_CR47","doi-asserted-by":"publisher","DOI":"10.1145\/1462173.1462178","author":"E Van Den Berg","year":"2009","unstructured":"Van Den Berg, E., Friedlander, M.P., Hennenfent, G., Herrmann, F.J., Saab, R., Yilmaz, D.: Sparco: a testing framework for sparse reconstruction. ACM Trans. Math. Softw. (2009). https:\/\/doi.org\/10.1145\/1462173.1462178","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"2176_CR48","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s10013-016-0238-3","volume":"45","author":"Q Van Nguyen","year":"2017","unstructured":"Van Nguyen, Q.: Forward-backward splitting with Bregman distances. Vietnam J. Math. 45(3), 519\u2013539 (2017)","journal-title":"Vietnam J. Math."},{"issue":"3","key":"2176_CR49","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2176_CR50","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1137\/140971580","volume":"25","author":"M Xu","year":"2015","unstructured":"Xu, M., Ye, J.J., Zhang, L.: Smoothing SQP methods for solving degenerate nonsmooth constrained optimization problems with applications to bilevel programs. SIAM J. Optim. 25(3), 1388\u20131410 (2015)","journal-title":"SIAM J. Optim."},{"issue":"8","key":"2176_CR51","doi-asserted-by":"crossref","first-page":"2378","DOI":"10.1109\/TCSI.2008.920131","volume":"55","author":"X Xue","year":"2008","unstructured":"Xue, X., Bian, W.: Subgradient-based neural networks for nonsmooth convex optimization problems. IEEE Trans. Circuits Syst. I Regul. Pap. 55(8), 2378\u20132391 (2008)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"2","key":"2176_CR52","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/140974237","volume":"54","author":"WH Yang","year":"2016","unstructured":"Yang, W.H., Han, D.R.: Linear convergence of the alternating direction method of multipliers for a class of convex optimization problems. SIAM J. Numer. Anal. 54(2), 625\u2013640 (2016)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"2176_CR53","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/070702187","volume":"20","author":"C Zhang","year":"2009","unstructured":"Zhang, C., Chen, X.: Smoothing projected gradient method and its application to stochastic linear complementarity problems. SIAM J. Optim. 20(2), 627\u2013649 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2176_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/18M119611X","volume":"30","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Chen, X.: A smoothing active set method for linearly constrained non-Lipschitz nonconvex optimization. SIAM J. Optim. 30(1), 1\u201330 (2020)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02176-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02176-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02176-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T13:07:47Z","timestamp":1684415267000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02176-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,4]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["2176"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02176-6","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,4]]},"assertion":[{"value":"28 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}