{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:02:27Z","timestamp":1774414947748,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T00:00:00Z","timestamp":1536364800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hong Kong Research Grants Council","award":["PolyU153085\/16p"],"award-info":[{"award-number":["PolyU153085\/16p"]}]},{"name":"Grant-in-Aid for Scientific Research","award":["15K00031"],"award-info":[{"award-number":["15K00031"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10107-018-1327-8","type":"journal-article","created":{"date-parts":[[2018,9,8]],"date-time":"2018-09-08T03:43:52Z","timestamp":1536378232000},"page":"339-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems"],"prefix":"10.1007","volume":"176","author":[{"given":"Tianxiang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting Kei","family":"Pong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akiko","family":"Takeda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"1327_CR1","doi-asserted-by":"publisher","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27, 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"key":"1327_CR2","first-page":"218","volume":"38","author":"E Asplund","year":"1973","unstructured":"Asplund, E.: Differentiability of the metric projection in finite dimensional Euclidean space. Proc. Am. Math. Soc. 38, 218\u2013219 (1973)","journal-title":"Proc. Am. Math. Soc."},{"key":"1327_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, Berlin (2011)"},{"key":"1327_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"S Becker","year":"2011","unstructured":"Becker, S., Cand\u00e8s, E.J., Grant, M.: Templates for convex cone problems with applications to sparse signal recovery. Math. Progr. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Progr. Comput."},{"key":"1327_CR5","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1137\/090776718","volume":"31","author":"R Borsdorf","year":"2010","unstructured":"Borsdorf, R., Higham, N.J., Raydan, M.: Computing a nearest correlation matrix with factor structure. SIAM J. Matrix Anal. Appl. 31, 2603\u20132622 (2010)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1327_CR6","doi-asserted-by":"publisher","first-page":"12267","DOI":"10.1073\/pnas.0904287106","volume":"106","author":"J Brodie","year":"2009","unstructured":"Brodie, J., Daubechies, I., De Mol, C., Giannone, D., Loris, I.: Sparse and stable Markowitz portfolios. Proc. Natl. Acad. Sci. 106, 12267\u201312272 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1327_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"1327_CR8","unstructured":"Chen, C., Li, X., Tolman, C., Wang, S., Ye, Y.: Sparse portfolio selection via quasi-norm regularization. arXiv:1312.6350 , (2013)"},{"key":"1327_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Progr. 55, 293\u2013318 (1992)","journal-title":"Math. Progr."},{"key":"1327_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximations. Comput. Math. Appl. 2, 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"key":"1327_CR11","unstructured":"Gao, Y., Sun, D.: A majorized penalty approach for calibrating rank constrained correlation matrix problems, Technical report, National University of Singapore (2010)"},{"key":"1327_CR12","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: Proceedings of the 30th International Conference on Machine Learning, 37\u201345 (2013)"},{"key":"1327_CR13","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25, 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"1327_CR14","unstructured":"Lu, Z., Li, X.: Sparse recovery via partial regularization: models, theory and algorithms. arXiv:1511.07293 (2015)"},{"key":"1327_CR15","doi-asserted-by":"publisher","first-page":"2448","DOI":"10.1137\/100808071","volume":"23","author":"Z Lu","year":"2013","unstructured":"Lu, Z., Zhang, Y.: Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23, 2448\u20132478 (2013)","journal-title":"SIAM J. Optim."},{"key":"1327_CR16","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/10556788.2014.936438","volume":"30","author":"Z Lu","year":"2015","unstructured":"Lu, Z., Zhang, Y., Li, X.: Penalty decomposition methods for rank minimization. Optim. Methods Softw. 30, 531\u2013558 (2015)","journal-title":"Optim. Methods Softw."},{"key":"1327_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11075-006-9056-0","volume":"43","author":"Y Lucet","year":"2006","unstructured":"Lucet, Y.: Fast Moreau envelope computation I: numerical algorithms. Numer. Algorithms 43, 235\u2013249 (2006)","journal-title":"Numer. Algorithms"},{"key":"1327_CR18","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1016\/j.automatica.2007.09.011","volume":"44","author":"I Markovsky","year":"2008","unstructured":"Markovsky, I.: Structured low-rank approximation and its applications. Automatica 44, 891\u2013909 (2008)","journal-title":"Automatica"},{"key":"1327_CR19","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Financ. 7, 77\u201391 (1952)","journal-title":"J. Financ."},{"key":"1327_CR20","doi-asserted-by":"publisher","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. Progr. 103, 127\u2013152 (2005)","journal-title":"Math. Progr."},{"key":"1327_CR21","doi-asserted-by":"crossref","unstructured":"Parekh, A., Selesnick, I.W.: Convex fused Lasso denoising with non-convex regularization and its use for pulse detection. In: Proceedings of IEEE Signal Processing in Medicine and Biology Symposium, 1\u20136 (2015)","DOI":"10.1109\/SPMB.2015.7405474"},{"key":"1327_CR22","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions for linear matrix equations via nuclear norm minimization. SIAM Rev 52, 471\u2013501 (2010)","journal-title":"SIAM Rev"},{"key":"1327_CR23","unstructured":"Richard, E., Savalle, P.-A., Vayatis, N.: Estimation of simultaneously sparse and low rank matrices. arXiv:1206.6474 (2012)"},{"key":"1327_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1327_CR25","doi-asserted-by":"publisher","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":"1327_CR26","doi-asserted-by":"publisher","first-page":"3004","DOI":"10.1214\/13-EJS868","volume":"7","author":"M Slawski","year":"2013","unstructured":"Slawski, M., Hein, M.: Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization. Electron. J. Stat. 7, 3004\u20133056 (2013)","journal-title":"Electron. J. Stat."},{"key":"1327_CR27","unstructured":"Thiao, M., Pham, D.T., Le Thi, H.A.: A DC programming approach for sparse eigenvalue problem. In: Proceedings of the 27th International Conference on Machine Learning, 1063\u20131070 (2010)"},{"key":"1327_CR28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"1327_CR29","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1214\/11-AOS878","volume":"39","author":"R Tibshirani","year":"2011","unstructured":"Tibshirani, R., Taylor, J.: The solution path of the generalized Lasso. Ann. Stat. 39, 1335\u20131371 (2011)","journal-title":"Ann. Stat."},{"key":"1327_CR30","unstructured":"Tono, K., Takeda, A., Gotoh, J.: Efficient DC algorithm for constrained sparse optimization. arXiv:1701.08498 (2017)"},{"key":"1327_CR31","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1327_CR32","first-page":"458","volume":"26","author":"YL Yu","year":"2013","unstructured":"Yu, Y.L.: Better approximation and faster algorithm using the proximal average. Adv. Neural Inf. Process. Syst. 26, 458\u2013466 (2013)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1327_CR33","unstructured":"Yu, Y.L., Zheng, X., Marchetti-Bowick, M., Xing, E.: Minimizing nonconvex non-separable functions. In: Proceedings of the 18th International Conference on Artificial Intelligence and Statistics 38, 1107\u20131115 (2015)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1327-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1327-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1327-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T03:18:01Z","timestamp":1720581481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1327-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,8]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["1327"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1327-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,8]]},"assertion":[{"value":"16 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}