{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T16:00:07Z","timestamp":1776700807542,"version":"3.51.2"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000026","name":"National Institute on Drug Abuse","doi-asserted-by":"publisher","award":["P50 DA036107"],"award-info":[{"award-number":["P50 DA036107"]}],"id":[{"id":"10.13039\/100000026","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000026","name":"National Institute on Drug Abuse","doi-asserted-by":"publisher","award":["P50 DA039838"],"award-info":[{"award-number":["P50 DA039838"]}],"id":[{"id":"10.13039\/100000026","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1512422"],"award-info":[{"award-number":["1512422"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Penn State Grace Woodward Collaborative Engineering\/Medicine Research Grant"},{"name":"Institute for Cyber Science Seed Grant"},{"name":"Institute for Cyber Science Seed Grant"},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1300638"],"award-info":[{"award-number":["1300638"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["71528005"],"award-info":[{"award-number":["71528005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10107-018-1278-0","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T11:54:49Z","timestamp":1525348489000},"page":"69-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming"],"prefix":"10.1007","volume":"178","author":[{"given":"Hongcheng","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2124-5678","authenticated-orcid":false,"given":"Tao","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runze","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"1278_CR1","unstructured":"Agarwal, A., Negahban, S., Wainwright, M.J.: Stochastic optimization and sparsity statistical recovery: optimal algorithms for high dimensions. In: Advances in Neural Information Processing Systems, pp. 1538\u20131546 (2012)"},{"key":"1278_CR2","unstructured":"Bach, F., Moulines, E.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Advances in Neural Information Processing Systems, pp. 451\u2013459 (2011)"},{"key":"1278_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"PL Bartlett","year":"2006","unstructured":"Bartlett, P.L., Jordan, M.I., McAuliffe, J.D.: Convexity, classification, and risk bounds. J. Am. Stat. Assoc. 101, 138\u2013156 (2006)","journal-title":"J. Am. Stat. Assoc."},{"key":"1278_CR4","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.: Complexity analysis of interior point algorithms for non-Lipschitz and non-convex minimization. Math. Prog. A 149, 301\u2013327 (2015)","journal-title":"Math. Prog. A"},{"key":"1278_CR5","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"PJ Bickel","year":"2009","unstructured":"Bickel, P.J., Ritov, Y., Tsybakov, A.B.: Simultaneous analysis of Lasso and Dantzig selector. Ann. Stat. 37, 1705\u20131732 (2009)","journal-title":"Ann. Stat."},{"key":"1278_CR6","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Cand\u00e9s","year":"2007","unstructured":"Cand\u00e9s, E., Tao, T.: The Dantzig selector: statistical estimation when $$p$$ is much larger than n. Ann. Stat. 35, 2313\u20132351 (2007)","journal-title":"Ann. Stat."},{"key":"1278_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.I.: Adaptive cubic regularization methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Prog. A 127, 245\u2013295 (2011)","journal-title":"Math. Prog. A"},{"key":"1278_CR8","doi-asserted-by":"publisher","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 $$\\text{ L }_2$$-$$\\text{ L }_{p}$$ minimization. Math. Prog. A 143, 371\u2013383 (2014)","journal-title":"Math. Prog. A"},{"key":"1278_CR9","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1214\/aos\/1176351052","volume":"16","author":"J Dupa\u010dov\u00e1","year":"1988","unstructured":"Dupa\u010dov\u00e1, J., Wets, R.: Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems. Ann. Stat. 16, 1517\u20131549 (1988)","journal-title":"Ann. Stat."},{"key":"1278_CR10","doi-asserted-by":"publisher","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, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"1278_CR11","doi-asserted-by":"publisher","first-page":"5467","DOI":"10.1109\/TIT.2011.2158486","volume":"57","author":"J Fan","year":"2011","unstructured":"Fan, J., Lv, J.: Nonconcave penalized likelihood with NP-dimensionality. IEEE Trans. Inform. Theory 57, 5467\u20135484 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1278_CR12","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1214\/13-AOS1198","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":"1278_CR13","unstructured":"Ge, D., Wang, Z., Ye, Y., Yin, H.: Strong NP-hardness result for regularized $$L_q$$-minimization problems with concave penalty functions. Cornell University Library (2015). \n                    arXiv:1501.00622v1"},{"key":"1278_CR14","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2001","unstructured":"Kleywegt, A.J., Shapiro, A., Homem-de-Mello, T.: The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12, 479\u2013502 (2001)","journal-title":"SIAM J. Optim."},{"key":"1278_CR15","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1214\/15-AOS1380","volume":"44","author":"H Liu","year":"2016","unstructured":"Liu, H., Yao, T., Li, R.: Global solutions for folded concave penalized non-convex learning. Ann. Stat. 44, 629\u2013659 (2016)","journal-title":"Ann. Stat."},{"issue":"1-2","key":"1278_CR16","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-017-1114-y","volume":"166","author":"Hongcheng Liu","year":"2017","unstructured":"Liu, H., Yao, T., Li, R., Ye, Y.: Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory. Math. Program. (2017). \n                    https:\/\/doi.org\/10.1007\/s10107-017-1114-y","journal-title":"Mathematical Programming"},{"key":"1278_CR17","first-page":"559","volume":"16","author":"P-L Loh","year":"2015","unstructured":"Loh, P.-L., Wainwright, M.J.: Regularized M-estimators with nonconvexity: statistical and algorithmic theory for local optima. J. Mach. Learn. Res. 16, 559\u2013616 (2015)","journal-title":"J. Mach. Learn. Res."},{"key":"1278_CR18","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1214\/12-STS400","volume":"27","author":"SN Negahban","year":"2012","unstructured":"Negahban, S.N., Ravikumar, P., Wainwright, M.J., Yu, B.: A unified framework for high-dimensional analysis of $$M$$-estimators with decomposable regularizers. Stat. Sci. 27, 538\u2013557 (2012)","journal-title":"Stat. Sci."},{"key":"1278_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton\u2019s method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1278_CR20","volume-title":"Stochastic Programming, Handbook in OR and MS","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: Monte Carlo sampling methods. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming, Handbook in OR and MS, vol. 10. North-Holland Publishing Company, Amsterdam (2003)"},{"key":"1278_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming Modeling and Theory. The Society for Industrial and Applied Mathematics and the Mathematical Programming Society, Philadelphia (2009)"},{"issue":"3","key":"1278_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930801954177","volume":"57","author":"A Shapiro","year":"2008","unstructured":"Shapiro, A., Xu, H.: Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation. Optimization 57(3), 395\u2013418 (2008)","journal-title":"Optimization"},{"key":"1278_CR23","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1214\/13-AOS1159","volume":"41","author":"L Wang","year":"2013","unstructured":"Wang, L., Kim, Y., Li, R.: Calibrating non-convex penalized regressioni in ultra-high dimension. Ann. Stat. 41, 2505\u20132536 (2013)","journal-title":"Ann. Stat."},{"key":"1278_CR24","doi-asserted-by":"publisher","first-page":"2164","DOI":"10.1214\/14-AOS1238","volume":"42","author":"Z Wang","year":"2014","unstructured":"Wang, Z., Liu, H., Zhang, T.: Optimal computational and statistical rates of convergence for sparse non-convex learning problems. Ann. Stat. 42, 2164\u20132201 (2014)","journal-title":"Ann. Stat."},{"key":"1278_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y Ye","year":"1992","unstructured":"Ye, Y.: On affine scaling algorithms for non-convex quadratic programming. Math. Prog. 56, 285\u2013300 (1992)","journal-title":"Math. Prog."},{"key":"1278_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01581726","volume":"80","author":"Y Ye","year":"1998","unstructured":"Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Math. Prog. 80, 195\u2013211 (1998)","journal-title":"Math. Prog."},{"key":"1278_CR27","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"28","author":"C Zhang","year":"2010","unstructured":"Zhang, C.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 28, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"1278_CR28","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1214\/07-AOS520","volume":"36","author":"C-H Zhang","year":"2008","unstructured":"Zhang, C.-H., Huang, J.: The sparsity and bias of the Lasso selection in high-dimensional linear regression. Ann. Stat. 36, 1567\u20131594 (2008)","journal-title":"Ann. Stat."},{"key":"1278_CR29","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1214\/12-STS399","volume":"27","author":"C Zhang","year":"2012","unstructured":"Zhang, C., Zhang, T.: A general theory of concave regularization for high dimensional sparse estimation problems. Stat. Sci. 27, 576\u2013593 (2012)","journal-title":"Stat. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1278-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1278-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1278-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:28:31Z","timestamp":1589646511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1278-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["1278"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1278-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"3 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}