{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:45Z","timestamp":1740122445498,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Natural Science Foundation of Hunan Province, China","award":["13JJ2001"]},{"name":"Science Project of National University of Defense Technology","award":["JC120201"]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["61402495"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10898-017-0507-z","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T09:19:27Z","timestamp":1489137567000},"page":"815-826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Global convergence of proximal iteratively reweighted algorithm"],"prefix":"10.1007","volume":"68","author":[{"given":"Tao","family":"Sun","sequence":"first","affiliation":[]},{"given":"Hao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Lizhi","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"issue":"1\u20132","key":"507_CR1","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., et al.: Complexity of unconstrained $$L_2$$ L 2 - $$L_p$$ L p minimization. Math. Program. 143(1\u20132), 371\u2013383 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"507_CR2","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$$ \u2113 q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"doi-asserted-by":"crossref","unstructured":"Lu, C., Wei, Y., Lin, Z., Yan, S.: Proximal iteratively reweighted algorithm with multiple splitting for nonconvex sparsity optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence (2014)","key":"507_CR3","DOI":"10.1609\/aaai.v28i1.8897"},{"issue":"1","key":"507_CR4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/140971518","volume":"8","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Dosovitskiy, A., Brox, T., et al.: On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision. SIAM J. Imaging Sci. 8(1), 331\u2013372 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"507_CR5","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., et al.: iPiano: inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2), 1388\u20131419 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"507_CR6","doi-asserted-by":"crossref","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":"2","key":"507_CR7","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., Le Thi Hoai, A.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"507_CR8","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., Le Thi Hoai, A.: 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":"12","key":"507_CR9","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.K., Zhang, C.: Non-Lipschitz-regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21(12), 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"1\u20132","key":"507_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10589-013-9553-8","volume":"59","author":"X Chen","year":"2014","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$\\ell _1$$ \u2113 1 minimization algorithm for $$\\ell _2$$ \u2113 2 - $$\\ell _p$$ \u2113 p minimization. Comput. Optim. Appl. 59(1\u20132), 47\u201361 (2014)","journal-title":"Comput. Optim. Appl."},{"doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: IEEE International Conference on Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE (2008)","key":"507_CR11","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"12","key":"507_CR12","doi-asserted-by":"crossref","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Trans. Signal Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"507_CR13","first-page":"1439","volume":"3","author":"J Weston","year":"2003","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., et al.: The use of zero-norm with linear models and kernel methods. J. Mach. Learn. Res. 3, 1439\u20131461 (2003)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Zhang, T.: Multi-stage convex relaxation for learning with sparse regularization. In: Proceedings of the 22nd Annual Conference on Neural Information Processing Systems. 8\u201313 December, 2008; Vancouver, British, pp 1929\u20131936 (2008)","key":"507_CR14"},{"issue":"4","key":"507_CR15","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Va, A., Wajs, E.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"1","key":"507_CR16","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":"4","key":"507_CR17","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2009","unstructured":"Wen, Z., Yin, W., Goldfarb, D., et al.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"507_CR18","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."},{"doi-asserted-by":"crossref","unstructured":"Lu, C., Tang, J., Yan, S., Lin, Z.: Generalized nonconvex nonsmooth low-rank minimization. In: IEEE International Conference on Computer Vision and Pattern Recognition (2014)","key":"507_CR19","DOI":"10.1109\/CVPR.2014.526"},{"doi-asserted-by":"crossref","unstructured":"Lu, C., Zhu, C., Xu, C., Yan, S., Lin, Z.: Generalized singular value thresholding. In: Proceedings of the AAAI Conference on Artificial Intelligence (2015)","key":"507_CR20","DOI":"10.1609\/aaai.v29i1.9464"},{"doi-asserted-by":"crossref","unstructured":"Mordukhovich, B.S.: Variational analysis and generalized differentiation. I: Basic theory, Cs.nmu.edu (2006)","key":"507_CR21","DOI":"10.1007\/3-540-31246-3"},{"key":"507_CR22","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, New York (2009)"},{"key":"507_CR23","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)"},{"key":"507_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"507_CR25","first-page":"87","volume":"117","author":"S Lojasiewicz","year":"1963","unstructured":"Lojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9ls[J]. Les \u00e9quations aux d\u00e9riv\u00e9es partielles 117, 87\u201389 (1963)","journal-title":"Les \u00e9quations aux d\u00e9riv\u00e9es partielles"},{"issue":"3","key":"507_CR26","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Annales de l\u2019institut Fourier 48(3), 769\u2013783 (1998)","journal-title":"Annales de l\u2019institut Fourier"},{"issue":"1\u20132","key":"507_CR27","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"507_CR28","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., et al.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-Lojasiewicz inequality. Math. Oper. Res. 35(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"507_CR29","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"507_CR30","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1137\/060670080","volume":"18","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A., et al.: Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2), 556\u2013572 (2007)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"507_CR31","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forwardCbackward splitting, and regularized gauss-seidel methods. Math. Program. 137(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"507_CR32","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-017-0507-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0507-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-017-0507-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T21:31:42Z","timestamp":1658784702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-017-0507-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["507"],"URL":"https:\/\/doi.org\/10.1007\/s10898-017-0507-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2017,3,10]]}}}