{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:36:16Z","timestamp":1767915376928,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:00:00Z","timestamp":1656374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871453,11731013"],"award-info":[{"award-number":["11871453,11731013"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanities and Social Sciences, the Ministry of Education","award":["17JYJAZH011"],"award-info":[{"award-number":["17JYJAZH011"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11371154, 11331012, 81173633"],"award-info":[{"award-number":["11371154, 11331012, 81173633"]}],"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":["11971106"],"award-info":[{"award-number":["11971106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program by CAST","award":["2018QNRC001"],"award-info":[{"award-number":["2018QNRC001"]}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association of the Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["2020-2023"],"award-info":[{"award-number":["2020-2023"]}],"id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2018A030313229"],"award-info":[{"award-number":["2018A030313229"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10915-022-01897-6","type":"journal-article","created":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T13:03:47Z","timestamp":1656421427000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Interior Stochastic Gradient Method for a Class of Non-Lipschitz Optimization Problems"],"prefix":"10.1007","volume":"92","author":[{"given":"Wanyou","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3492-9235","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,28]]},"reference":[{"key":"1897_CR1","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/120869778","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Eldar, Y.C.: Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J. Optim. 23, 1480\u20131509 (2013)","journal-title":"SIAM J. Optim."},{"key":"1897_CR2","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1287\/moor.2016.0837","volume":"42","author":"W Bian","year":"2017","unstructured":"Bian, W., Chen, X.: Optimality and complexity for constrained optimization problems with nonconvex regularization. Math. Oper. Res. 42, 1063\u20131084 (2017)","journal-title":"Math. Oper. Res."},{"key":"1897_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"Bian, W., Chen, X., Ye, Y.Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. 149, 301\u2013327 (2015)","journal-title":"Math. Program."},{"key":"1897_CR4","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"E Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1897_CR5","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-012-0613-0","volume":"143","author":"X Chen","year":"2014","unstructured":"Chen, X., Ge, D., Wang, Z., Ye, Y.: Complexity of unconstrained $$\\ell _2$$-$$\\ell _p$$ minimization. Math. Program. 143, 371\u2013383 (2014)","journal-title":"Math. Program."},{"key":"1897_CR6","doi-asserted-by":"crossref","first-page":"4709","DOI":"10.1109\/TIP.2012.2214051","volume":"21","author":"X Chen","year":"2012","unstructured":"Chen, X., Ng, M., Zhang, C.: Nonconvex $$\\ell _p $$ regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21, 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"1897_CR7","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1137\/120871390","volume":"23","author":"X Chen","year":"2013","unstructured":"Chen, X., Niu, L.F., Yuan, Y.X.: Optimality conditions and a smoothing trust region Newton method for nonLipschitz optimization. SIAM J. Optim. 23, 1528\u20131552 (2013)","journal-title":"SIAM J. Optim."},{"key":"1897_CR8","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/18M1166511","volume":"29","author":"X Chen","year":"2019","unstructured":"Chen, X., Toint, Ph.L., Wang, H.: Complexity of partially-separable convexly-constrained optimization with non-Lipschitzian singularities. SIAM J. Optim. 29, 874\u2013903 (2019)","journal-title":"SIAM J. Optim."},{"key":"1897_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-020-01470-9","volume":"187","author":"X Chen","year":"2020","unstructured":"Chen, X., Toint, Ph.L.: High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms. Math. Program. 187, 47\u201378 (2020)","journal-title":"Math. Program."},{"key":"1897_CR10","doi-asserted-by":"crossref","first-page":"2832","DOI":"10.1137\/090761471","volume":"32","author":"X Chen","year":"2010","unstructured":"Chen, X., Xu, F., Ye, Y.: Lower bound theory of nonzero entries in solutions of $$\\ell _2$$-$$\\ell _p$$ minimization. SIAM J. Imaging Sci. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"1897_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., Devore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63, 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"key":"1897_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1897_CR13","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, 819\u2013849 (2014)","journal-title":"Ann. Stat."},{"key":"1897_CR14","first-page":"1721","volume":"21","author":"D Ge","year":"2011","unstructured":"Ge, D., Jiang, X., Ye, Y.: A note on the complexity of $$l_p$$ minimization. Math. Program. 21, 1721\u20131739 (2011)","journal-title":"Math. Program."},{"key":"1897_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10107-016-1107-2","volume":"166","author":"DD Ge","year":"2017","unstructured":"Ge, D.D., He, R.H., He, S.M.: An improved algorithm for the $${L}_2$$-$${L}_p$$ minimization problem. Math. Program. 166, 131\u2013158 (2017)","journal-title":"Math. Program."},{"key":"1897_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155, 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"1897_CR17","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"MJ Lai","year":"2011","unstructured":"Lai, M.J., Wang, Y.: An unconstrained $$\\ell _q$$ minimization with $$0<q<1$$ for sparse solution of under-determined linear systems. SIAM J. Optim. 21, 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"1897_CR18","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"MJ Lai","year":"2013","unstructured":"Lai, M.J., Xu, Y., Yin, W.: Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ minimization. SIAM J. Numer. Anal. 51, 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"key":"1897_CR19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10589-014-9683-7","volume":"59","author":"DH Li","year":"2014","unstructured":"Li, D.H., Sun, Z., Zhang, X.J.: A constrained optimization reformulation and a feasible descent direction method for $${L}_{{1}\/{2}}$$ regularization. Comput. Optim. Appl. 59, 263\u2013284 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1897_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10107-015-0939-5","volume":"158","author":"YF Liu","year":"2016","unstructured":"Liu, Y.F., Ma, S.Q., Dai, Y.H., Zhang, S.Z.: A smoothing SQP framework for a class of composite $${L}_q$$ minimization over polyhedron. Math. Program. 158, 467\u2013500 (2016)","journal-title":"Math. Program."},{"key":"1897_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10107-013-0722-4","volume":"147","author":"ZS Lu","year":"2014","unstructured":"Lu, Z.S.: Iterative reweighted minimization methods for $$\\ell _p$$ regularized unconstrained nonlinear programming. Math. Program. 147, 277\u2013307 (2014)","journal-title":"Math. Program."},{"key":"1897_CR22","unstructured":"Metel, M.R., Takeda, A.: Simple stochastic gradient methods for non-smooth non-convex regularized optimization. ICML, pages 4537\u20134545, (2019)"},{"key":"1897_CR23","first-page":"1","volume":"21","author":"NH Pham","year":"2020","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: Proxsarah: An efficient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Learn. Res. 21, 1\u201348 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"1897_CR24","unstructured":"Reddi, S.J., Sra, S., P\u00f3czos, B., Smola, A.: Proximal stochastic methods for nonsmooth non-convex finite-sum optimization. In: NIPS, (2016)"},{"key":"1897_CR25","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, 3rd printing Springer Verlag, Heidelberg, Berlin, New York (2009)","edition":"3rd printing"},{"key":"1897_CR26","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10589-017-9932-7","volume":"68","author":"X Wang","year":"2017","unstructured":"Wang, X., Wang, S.X., Zhang, H.: Inexact proximal stochastic gradient method for convex composite optimization. Comput. Optim. and Appl. 68, 579\u2013618 (2017)","journal-title":"Comput. Optim. and Appl."},{"key":"1897_CR27","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1080\/10556788.2020.1713128","volume":"35","author":"X Wang","year":"2020","unstructured":"Wang, X., Zhang, H.: Inexact proximal stochastic second-order methods for nonconvex composite optimization. Optim. Method Softw. 35, 808\u2013835 (2020)","journal-title":"Optim. Method Softw."},{"key":"1897_CR28","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1080\/10556788.2018.1471141","volume":"34","author":"XY Wang","year":"2019","unstructured":"Wang, X.Y., Wang, X., Yuan, Y.: Stochastic proximal quasi-Newton methods for non-convex composite optimization. Optim. Method Softw. 34, 922\u2013948 (2019)","journal-title":"Optim. Method Softw."},{"key":"1897_CR29","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"ZW Wen","year":"2010","unstructured":"Wen, Z.W., Yin, W.T., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32, 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"1897_CR30","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"J Wright","year":"2019","unstructured":"Wright, J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2019)","journal-title":"IEEE Trans. Signal Process."},{"key":"1897_CR31","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24, 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"1897_CR32","unstructured":"Xu, Y., Jin, R., Yang, T.: Stochastic proximal gradient methods for non-smooth non-convex regularized problems. arXiv:1902.07672v3 [math.OC], 30 Mar (2019)"},{"key":"1897_CR33","unstructured":"Xu, Y., Qi, Q., Lin, Q., Jin, R., Yang, T.: Stochastic optimization for DC functions and non-smooth non-convex regularizers with non-asymptotic convergence. ICML, pages 6942\u20136951, (2019)"},{"key":"1897_CR34","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"ZB Xu","year":"2012","unstructured":"Xu, Z.B., Chang, X.Y., Xu, F.M., Zhang, H.: $${L}_{{1}\/{2}}$$ regularization: A thresholding representation theory and a fast solver. IEEE T. Neur. Net. Lear. 23, 1013\u20131027 (2012)","journal-title":"IEEE T. Neur. Net. Lear."},{"key":"1897_CR35","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1109\/JPROC.2012.2188013","volume":"100","author":"GX Yuan","year":"2012","unstructured":"Yuan, G.X., Ho, C.H., Lin, C.J.: Recent advances of large-scale linear classification. Proceedings of the IEEE 100, 2584\u20132603 (2012)","journal-title":"Proceedings of the IEEE"},{"key":"1897_CR36","doi-asserted-by":"publisher","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 optimizaiton. SIAM J. Optim 30, 1\u201330 (2020)","journal-title":"SIAM J. Optim"},{"key":"1897_CR37","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-018-1236-x","volume":"169","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Xin, J.: Minimization of transformed $${L}_1$$ penalty: theory, difference of convex function algorithm, and robust application in compressed sensing. Math. Program. 169, 307\u2013336 (2018)","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01897-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01897-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01897-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T21:28:12Z","timestamp":1659043692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01897-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,28]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["1897"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01897-6","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,28]]},"assertion":[{"value":"17 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"42"}}