{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T09:15:08Z","timestamp":1720602908866},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T00:00:00Z","timestamp":1406937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10589-014-9683-7","type":"journal-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T15:08:07Z","timestamp":1406905687000},"page":"263-284","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A constrained optimization reformulation and a feasible descent direction method for $$L_{1\/2}$$ L 1 \/ 2 regularization"],"prefix":"10.1007","volume":"59","author":[{"given":"Dong-Hui","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiong-ji","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,2]]},"reference":[{"key":"9683_CR1","doi-asserted-by":"crossref","unstructured":"Bian, W., Chen, X., Ye, Y.: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Math. Program. (2014). doi: 10.1007\/s10107-014-0753-5","DOI":"10.1007\/s10107-014-0753-5"},{"key":"9683_CR2","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/060657704","volume":"51","author":"AM Bruckstein","year":"2009","unstructured":"Bruckstein, A.M., Donoho, D.L., Elad, M.: From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51, 34\u201381 (2009)","journal-title":"SIAM Rev."},{"key":"9683_CR3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E Candes","year":"2006","unstructured":"Candes, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9683_CR4","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"E Candes","year":"2008","unstructured":"Candes, E., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted $$L_1$$ L 1 minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"9683_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1137\/0306032","volume":"6","author":"M Canon","year":"1968","unstructured":"Canon, M., Cullum, C.: A tight upper bound on the rate of convergence of the Frank\u2013Wolfe algorithm. SIAM J. Control 6, 509\u2013516 (1968)","journal-title":"SIAM J. Control"},{"key":"9683_CR6","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Process. Lett. 14, 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"key":"9683_CR7","doi-asserted-by":"crossref","unstructured":"Chartrand, R.: Nonconvex regularization for shape preservation. In: IEEE International Conference on Image Processing (ICIP). IEEE (2007)","DOI":"10.1109\/ICIP.2007.4378949"},{"key":"9683_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1088\/0266-5611\/24\/3\/035020","volume":"24","author":"R Chartrand","year":"2008","unstructured":"Chartrand, R., Staneva, V.: Restricted isometry properties and nonconvex compressive sensing. Inverse Probl. 24, 1\u201314 (2008)","journal-title":"Inverse Probl."},{"key":"9683_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"9683_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$$ \u2113 2 - \u2113 p minimization. SIAM J. Sci. Comput. 32, 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"9683_CR11","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 $$L_2-L_p$$ L 2 - L p minimization. Math. Program. 143, 371\u2013383 (2014)","journal-title":"Math. Program."},{"key":"9683_CR12","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1137\/080740167","volume":"3","author":"X Chen","year":"2010","unstructured":"Chen, X., Zhou, W.: Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization. SIAM J. Imaging Sci. 3, 765\u2013790 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"9683_CR13","doi-asserted-by":"crossref","unstructured":"Chen, X., Zhou, W.: Convergence of the reweighted $$l_1$$ l 1 minimization algorithm for $$l_2-l_p$$ l 2 - l p minimization. Comput. Optim. Appl. (2013). doi: 10.1007\/s10589-013-9553-8","DOI":"10.1007\/s10589-013-9553-8"},{"key":"9683_CR14","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9683_CR15","doi-asserted-by":"crossref","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":"9683_CR16","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"MAT Figueiredo","year":"2007","unstructured":"Figueiredo, M.A.T., Nowak, R.D., Wright, S.J.: Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems. IEEE J. Sel. Top. Signal Process. 1, 586\u2013598 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"key":"9683_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Quart. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"9683_CR18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"M Lai","year":"2011","unstructured":"Lai, M., Wang, J.: An unconstrained $$L_q$$ L q minimization with $$0<q\\le 1$$ 0 < q \u2264 1 for sparse solution of under-determined linear systems. SIAM J. Optim. 21, 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"key":"9683_CR19","doi-asserted-by":"crossref","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming. Math. Program. (2013). doi: 10.1007\/s10107-013-0722-4","DOI":"10.1007\/s10107-013-0722-4"},{"key":"9683_CR20","unstructured":"Nikolova, M.: Analysis of the recovery of edges in images and signals by minimizing nonconvex regularized least-squares. Multiscale Model. Simul. 4, 960\u2013991 (2005)"},{"key":"9683_CR21","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"M Osborne","year":"2000","unstructured":"Osborne, M., Presnell, B., Turlach, B.: A new approach to variable selection in least squares problems. IMA J. Numer. Anal. 20, 389\u2013404 (2000)","journal-title":"IMA J. Numer. Anal."},{"key":"9683_CR22","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.sigpro.2005.05.025","volume":"86","author":"A Petukhov","year":"2006","unstructured":"Petukhov, A.: Fast implementation of orthogonal greedy algorithm for tight wavelet frames. Signal Process 86, 471\u2013479 (2006)","journal-title":"Signal Process"},{"key":"9683_CR23","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/BF01584544","volume":"2","author":"O Pironneau","year":"1972","unstructured":"Pironneau, O., Polak, E.: On the rate of convergence of certain method of centers. Math. Program. 2, 230\u2013257 (1972)","journal-title":"Math. Program."},{"key":"9683_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1137\/0710017","volume":"10","author":"O Pironneau","year":"1973","unstructured":"Pironneau, O., Polak, E.: Rate of convergence of a class of methods of feasible directions. SIAM J. Numer. Anal. 10, 161\u2013174 (1973)","journal-title":"SIAM J. Numer. Anal."},{"key":"9683_CR25","volume-title":"Computational Method in Optimization","author":"E Polyk","year":"1971","unstructured":"Polyk, E.: Computational Method in Optimization. Academic Press, New York (1971)"},{"key":"9683_CR26","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. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9683_CR27","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0305018","volume":"5","author":"D Topkis","year":"1967","unstructured":"Topkis, D., Veinnott, A.: On the convergence of some feasible direction algorithms for non-linear programming. SIAM J. Control 5, 268\u2013279 (1967)","journal-title":"SIAM J. Control"},{"key":"9683_CR28","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"JA Tropp","year":"2007","unstructured":"Tropp, J.A., Gilbert, A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53, 4655\u20134667 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9683_CR29","first-page":"401","volume":"10","author":"L Wu","year":"2014","unstructured":"Wu, L., Sun, Z., Li, D.H.: A gradient based method for the $$L_2-L_{1\/2}$$ L 2 - L 1 \/ 2 minimization and application to compressive sensing. Pac. J. Optim. 10, 401\u2013414 (2014)","journal-title":"Pac. J. Optim."},{"key":"9683_CR30","first-page":"1","volume":"52","author":"Z Xu","year":"2009","unstructured":"Xu, Z., Zhang, H., Wang, Y., Chang, X.: $$L_{1\/2}$$ L 1 \/ 2 regularizer. Sci. China Ser. F 52, 1\u20139 (2009)","journal-title":"Sci. China Ser. F"},{"key":"9683_CR31","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Chang, X., Xu, F., Zhang, H.: $$L_{1\/2}$$ L 1 \/ 2 regularization: a thresholding representation theory and a fast solver. IEEE Trans. Neural Netw. Learn. Syst. 23, 1013\u20131027 (2012)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"9683_CR32","volume-title":"Methods of Feasible Directions","author":"G Zoutendijk","year":"1960","unstructured":"Zoutendijk, G.: Methods of Feasible Directions. Elsevier, Amsterdam (1960)"},{"key":"9683_CR33","first-page":"991","volume":"153","author":"S Zukhoviskii","year":"1963","unstructured":"Zukhoviskii, S., Polak, R., Primak, M.: An algorithm for the solution of convex programming problems. Dokl. Akad. Nauk SSSR 153, 991\u20131000 (1963)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9683-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9683-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9683-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T19:54:07Z","timestamp":1717185247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9683-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,2]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9683"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9683-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,2]]}}}