{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:12:29Z","timestamp":1750997549016,"version":"3.41.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T00:00:00Z","timestamp":1508457600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1222507","1522383"],"award-info":[{"award-number":["1222507","1522383"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1632935"],"award-info":[{"award-number":["1632935"]}],"id":[{"id":"10.13039\/100000145","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":[[2018,5]]},"DOI":"10.1007\/s10915-017-0578-5","type":"journal-article","created":{"date-parts":[[2017,10,20]],"date-time":"2017-10-20T10:23:51Z","timestamp":1508495031000},"page":"1156-1186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Three $$l_1$$ Based Nonconvex Methods in Constructing Sparse Mean Reverting Portfolios"],"prefix":"10.1007","volume":"75","author":[{"given":"Xiaolong","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Knut","family":"Solna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jack","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,20]]},"reference":[{"key":"578_CR1","unstructured":"Barekat, F., Yin, K., Caflisch, R.E., Osher, S.J., Lai, R., Ozolins, V.: Compressed wannier modes found from an $$L_1$$ regularized energy functional. arXiv preprint arXiv:1403.6883 (2014)"},{"issue":"2","key":"578_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1093\/biomet\/64.2.355","volume":"64","author":"GE Box","year":"1977","unstructured":"Box, G.E., Tiao, G.C.: A canonical analysis of multiple time series. Biometrika 64(2), 355\u2013365 (1977)","journal-title":"Biometrika"},{"key":"578_CR3","volume-title":"Non-linear Optimization Techniques","author":"M Box","year":"1969","unstructured":"Box, M., Davies, D., Swann, W.H., Australia, I.: Non-linear Optimization Techniques, vol. 5. Oliver & Boyd, Edinburgh (1969)"},{"key":"578_CR4","unstructured":"Chow, S.-N., Yang, T.-S., Zhou, H.: Global optimizations by intermittent diffusion. National Science Council Tunghai University Endowment Fund for Academic Advancement Mathematics Research Promotion Center, p. 121 (2009)"},{"key":"578_CR5","unstructured":"Cuturi, M., D\u2019aspremont, A.: Mean reversion with a variance threshold. In: Proceedings of the 30th International Conference on Machine Learning (ICML-13), pp. 271\u2013279 (2013)"},{"issue":"3","key":"578_CR6","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1080\/14697688.2010.481634","volume":"11","author":"A d\u2019Aspremont","year":"2011","unstructured":"d\u2019Aspremont, A.: Identifying small mean-reverting portfolios. Quant. Finance 11(3), 351\u2013364 (2011)","journal-title":"Quant. Finance"},{"issue":"3","key":"578_CR7","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/050645506","volume":"49","author":"A d\u2019Aspremont","year":"2007","unstructured":"d\u2019Aspremont, A., El Ghaoui, L., Jordan, M.I., Lanckriet, G.R.: A direct formulation for sparse PCA using semidefinite programming. SIAM Rev. 49(3), 434\u2013448 (2007)","journal-title":"SIAM Rev."},{"issue":"2","key":"578_CR8","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R., et al.: Least angle regression. Ann. Stat. 32(2), 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"578_CR9","unstructured":"Engle, R.F., Granger, C.W.: Co-integration and error correction: representation, estimation, and testing. Econom. J. Econom. Soc. 55, 251\u2013276 (1987)"},{"issue":"4","key":"578_CR10","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to nonnegative least squares problems with applications. SIAM J. Imaging Sci. 6(4), 2010\u20132046 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"578_CR11","doi-asserted-by":"crossref","unstructured":"Fogarasi, N., Levendovszky, J.: Improved parameter estimation and simple trading algorithm for sparse, mean reverting portfolios. In: Annales Universitatis Scientiarium Budapestinensis, Sectio Computatorica, vol. 37, pp. 121\u2013144 (2012)","DOI":"10.71352\/ac.37.121"},{"issue":"1","key":"578_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103(1), 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"issue":"3\u20134","key":"578_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1093\/biomet\/28.3-4.321","volume":"28","author":"H Hotelling","year":"1936","unstructured":"Hotelling, H.: Relations between two sets of variates. Biometrika 28(3\u20134), 321\u2013377 (1936)","journal-title":"Biometrika"},{"key":"578_CR14","first-page":"1457","volume":"5","author":"PO Hoyer","year":"2004","unstructured":"Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457\u20131469 (2004)","journal-title":"J. Mach. Learn. Res."},{"issue":"8","key":"578_CR15","doi-asserted-by":"publisher","first-page":"2465","DOI":"10.1016\/j.spa.2008.12.006","volume":"119","author":"Y Hu","year":"2009","unstructured":"Hu, Y., Long, H.: Least squares estimator for Ornstein\u2013Uhlenbeck processes driven by $$\\alpha $$-stable motions. Stoch. Process. Appl. 119(8), 2465\u20132480 (2009)","journal-title":"Stoch. Process. Appl."},{"issue":"2","key":"578_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.acha.2011.09.006","volume":"32","author":"H Ji","year":"2012","unstructured":"Ji, H., Li, J., Shen, Z., Wang, K.: Image deconvolution using a characterization of sharp images in wavelet domain. Appl. Comput. Harmonic Anal. 32(2), 295\u2013304 (2012)","journal-title":"Appl. Comput. Harmonic Anal."},{"issue":"3","key":"578_CR17","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1198\/1061860032148","volume":"12","author":"IT Jolliffe","year":"2003","unstructured":"Jolliffe, I.T., Trendafilov, N.T., Uddin, M.: A modified principal component technique based on the lasso. J. Comput. Gr. Stat. 12(3), 531\u2013547 (2003)","journal-title":"J. Comput. Gr. Stat."},{"key":"578_CR18","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"578_CR19","doi-asserted-by":"crossref","unstructured":"Krishnan, D., Tay, T., Fergus, R.: Blind deconvolution using a normalized sparsity measure. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 233\u2013240. IEEE (2011)","DOI":"10.1109\/CVPR.2011.5995521"},{"issue":"2","key":"578_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014)","journal-title":"J. Sci. Comput."},{"key":"578_CR21","unstructured":"Le Thi, H., Huynh, V., Pham Dinh, T.: Convergence analysis of DC algorithm for DC programming with subanalytic data. Annals of Operations Research, Technical Report, LMI, INSA-Rouen (2009)"},{"issue":"3","key":"578_CR22","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"HA Le Thi","year":"1997","unstructured":"Le Thi, H.A., Tao, P.D.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Glob. Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"578_CR23","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1137\/S0097539792240406","volume":"24","author":"BK Natarajan","year":"1995","unstructured":"Natarajan, B.K.: Sparse approximate solutions to linear systems. SIAM J. Comput. 24(2), 227\u2013234 (1995)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"578_CR24","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/120864799","volume":"54","author":"TT Ngo","year":"2012","unstructured":"Ngo, T.T., Bellalij, M., Saad, Y.: The trace ratio optimization problem. SIAM Rev. 54(3), 545\u2013569 (2012)","journal-title":"SIAM Rev."},{"issue":"46","key":"578_CR25","doi-asserted-by":"publisher","first-page":"18368","DOI":"10.1073\/pnas.1318679110","volume":"110","author":"V Ozoli\u0146\u0161","year":"2013","unstructured":"Ozoli\u0146\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed modes for variational problems in mathematics and physics. Proc. Natl. Acad. Sci. 110(46), 18368\u201318373 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"578_CR26","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1073\/pnas.1323260111","volume":"111","author":"V Ozoli\u0146\u0161","year":"2014","unstructured":"Ozoli\u0146\u0161, V., Lai, R., Caflisch, R., Osher, S.: Compressed plane waves yield a compactly supported multiresolution basis for the laplace operator. Proc. Natl. Acad. Sci. 111(5), 1691\u20131696 (2014)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"578_CR27","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M., Ahipa\u015fao\u011flu, S.D.: Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes. arXiv preprint arXiv:1212.4137 (2012)"},{"key":"578_CR28","doi-asserted-by":"crossref","unstructured":"Sriperumbudur, B.K., Torres, D.A., Lanckriet, G.R.: Sparse eigen methods by dc programming. In: Proceedings of the 24th International Conference on Machine Learning, pp. 831\u2013838. ACM (2007)","DOI":"10.1145\/1273496.1273601"},{"issue":"1","key":"578_CR29","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"578_CR30","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., Le Thi, H.A.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"578_CR31","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58, 267\u2013288 (1996)"},{"issue":"2","key":"578_CR32","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4310\/CIS.2014.v14.n2.a2","volume":"14","author":"P Yin","year":"2014","unstructured":"Yin, P., Esser, E., Xin, J.: Ratio and difference of l1 and l2 norms and sparse representation with coherent dictionaries. Commun. Inf. Syst. 14(2), 87\u2013109 (2014)","journal-title":"Commun. Inf. Syst."},{"issue":"1","key":"578_CR33","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jeconom.2012.01.004","volume":"169","author":"J Yu","year":"2012","unstructured":"Yu, J.: Bias in the estimation of the mean reversion parameter in continuous time models. J. Econom. 169(1), 114\u2013122 (2012)","journal-title":"J. Econom."},{"issue":"2","key":"578_CR34","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.: Sparse principal component analysis. J. Comput. Gr. Stat. 15(2), 265\u2013286 (2006)","journal-title":"J. Comput. Gr. Stat."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-017-0578-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0578-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-017-0578-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T16:20:17Z","timestamp":1750954817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-017-0578-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,20]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s10915-017-0578-5","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2017,10,20]]},"assertion":[{"value":"21 September 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}