{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:50:54Z","timestamp":1773809454296,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T00:00:00Z","timestamp":1439337600000},"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":["Math. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0939-5","type":"journal-article","created":{"date-parts":[[2015,8,11]],"date-time":"2015-08-11T09:51:47Z","timestamp":1439286707000},"page":"467-500","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["A smoothing SQP framework for a class of composite $$L_q$$ L q minimization over polyhedron"],"prefix":"10.1007","volume":"158","author":[{"given":"Ya-Feng","family":"Liu","sequence":"first","affiliation":[]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yu-Hong","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,12]]},"reference":[{"issue":"1","key":"939_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8(1), 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"939_CR2","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\u2013thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"939_CR3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization. MPS\u2013SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. MPS\u2013SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"issue":"2","key":"939_CR4","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"EVD Berg","year":"2008","unstructured":"Berg, E.V.D., Friedlander, M.P.: Probing the pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"939_CR5","volume-title":"Convex Analyis and Optimization","author":"DP Bertsekas","year":"2003","unstructured":"Bertsekas, D.P.: Convex Analyis and Optimization. Athena Scientific, Massachusetts (2003)"},{"issue":"3","key":"939_CR6","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"Bian, W., Chen, X.: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM J. Optim. 23(3), 1718\u20131741 (2013)","journal-title":"SIAM J. Optim."},{"key":"939_CR7","unstructured":"Bian, W., Chen, X.: Smoothing quadratic regularization methods for box constrained non-Lipschitz optimization in image restoration. Technical report, Hong Kong Polytechnic University (2014)"},{"issue":"1\u20132","key":"939_CR8","doi-asserted-by":"crossref","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 nonconvex minimization. Math. Program. 149(1\u20132), 301\u2013327 (2015)","journal-title":"Math. Program."},{"issue":"5","key":"939_CR9","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1016\/j.orl.2004.11.004","volume":"33","author":"SI Birbil","year":"2005","unstructured":"Birbil, S.I., Fang, S.C., Frenk, J.B.G., Zhang, S.: Recursive approximation of the high dimensional max function. Oper. Res. Lett. 33(5), 450\u2013458 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"939_CR10","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"939_CR11","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: The Fifth Annual Workshop of Computational Learning Theory, pp. 144\u2013152 (1992)","DOI":"10.1145\/130385.130401"},{"issue":"1","key":"939_CR12","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(1), 34\u201381 (2009)","journal-title":"SIAM Rev."},{"issue":"12","key":"939_CR13","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"EJ Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"939_CR14","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted $$\\ell _1$$ \u2113 1 minimization. J. Fourier Anal. Appl. 14(5), 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"issue":"2","key":"939_CR15","doi-asserted-by":"crossref","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.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. 127(2), 245\u2013295 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"939_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. 130(2), 295\u2013319 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"939_CR17","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1137\/11082381X","volume":"21","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)","journal-title":"SIAM J. Optim."},{"issue":"10","key":"939_CR18","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(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"issue":"3","key":"939_CR19","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(3), 1\u201314 (2008)","journal-title":"Inverse Probl."},{"key":"939_CR20","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: Internal Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3869\u20133872 (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"1","key":"939_CR21","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-012-0569-0","volume":"134","author":"X Chen","year":"2012","unstructured":"Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134(1), 71\u201399 (2012)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"939_CR22","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 2 - $$l_p$$ l p minimization. Math. Program. 143(1\u20132), 371\u2013383 (2014)","journal-title":"Math. Program."},{"issue":"12","key":"939_CR23","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 $$l_{{p}}$$ l p -regularization and box constrained model for image restoration. IEEE Trans. Image Process. 21(12), 4709\u20134721 (2012)","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"939_CR24","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1137\/120871390","volume":"23","author":"X Chen","year":"2013","unstructured":"Chen, X., Niu, L., Yuan, Y.: Optimality conditions and a smoothing trust region newton method for nonLipschitz optimization. SIAM J. Optim. 23(3), 1528\u20131552 (2013)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"939_CR25","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$$ \u2113 2 - $$\\ell _p$$ \u2113 p minimization. SIAM J. Sci. Comput. 32(5), 2832\u20132852 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"939_CR26","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(4), 765\u2013790 (2010)","journal-title":"SIAM J. Imaging Sci."},{"key":"939_CR27","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. John Wiley, New York (1983)"},{"issue":"3","key":"939_CR28","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"issue":"1","key":"939_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/22.1.1","volume":"22","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H., Liao, L.Z.: R-linear convergence of the Barzilai and Borwein gradient method. IMA J. Numer. Anal. 22(1), 1\u201310 (2002)","journal-title":"IMA J. Numer. Anal."},{"issue":"1","key":"939_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fcrk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"456","key":"939_CR31","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(456), 1348\u20131359 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"939_CR32","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.J.: Sparsest solutions of underdetermined linear systems via $$\\ell _q$$ \u2113 q -minimization for $$0 < q \\le 1$$ 0 < q \u2264 1 . Appl. Comput. Harmon. Anal. 26(3), 395\u2013407 (2009)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"939_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A Mathematical Introduction to Compressive Sensing","author":"S Foucart","year":"2013","unstructured":"Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, New York (2013)"},{"key":"939_CR34","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"3","key":"939_CR35","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1093\/imanum\/drs027","volume":"33","author":"R Garmanjani","year":"2013","unstructured":"Garmanjani, R., Vicente, L.N.: Smoothing and worst case complexity for direct-search methods in non-smooth optimization. IMA J. Numer. Anal. 33(3), 1008\u20131028 (2013)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"939_CR36","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10107-011-0470-2","volume":"129","author":"D Ge","year":"2011","unstructured":"Ge, D., Jiang, X., Ye, Y.: A note on the complexity of $$l_{p}$$ l p minimization. Math. Program. 129(2), 285\u2013299 (2011)","journal-title":"Math. Program."},{"key":"939_CR37","doi-asserted-by":"publisher","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Progam. (2015). doi: 10.1007\/s10107-015-0871-8","DOI":"10.1007\/s10107-015-0871-8"},{"issue":"1","key":"939_CR38","first-page":"95","volume":"100","author":"NIM Gould","year":"2004","unstructured":"Gould, N.I.M., Toint, P.L.: Preprocessing for quadratic programming. Math. Program. 100(1), 95\u2013132 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"939_CR39","doi-asserted-by":"crossref","first-page":"170","DOI":"10.4208\/jcm.2009.10-m1007","volume":"28","author":"ET Hale","year":"2010","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation applied to compressed sensing: implemetation and numerical experiments. J. Comput. Math. 28(2), 170\u2013194 (2010)","journal-title":"J. Comput. Math."},{"issue":"2","key":"939_CR40","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1093\/biomet\/asp020","volume":"96","author":"J Huang","year":"2009","unstructured":"Huang, J., Ma, S., Xie, H., Zhang, C.H.: A group bridge approach for variable selection. Biometrika 96(2), 339\u2013355 (2009)","journal-title":"Biometrika"},{"key":"939_CR41","doi-asserted-by":"crossref","unstructured":"Ji, S., Sze, K.F., Zhou, Z., So, A.M.C., Ye, Y.: Beyond convex relaxation: A polynomial-time non-convex optimization approach to network localization. In: IEEE Conference on Computer Communications (INFOCOM), pp. 2499\u20132507 (2013)","DOI":"10.1109\/INFCOM.2013.6567056"},{"key":"939_CR42","doi-asserted-by":"publisher","unstructured":"Jiang, B., Dai, Y.H.: A framework of constraint preserving update schemes for optimization on stiefel manifold. Math. Program. (2015). doi: 10.1007\/s10107-014-0816-7","DOI":"10.1007\/s10107-014-0816-7"},{"key":"939_CR43","unstructured":"Jiang, B., Zhang, S.: Iteration bounds for finding $$\\epsilon $$ \u03f5 -stationary points of structured nonconvex optimization. Technical report, University of Minnesota (2014)"},{"issue":"1","key":"939_CR44","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/090775397","volume":"21","author":"MJ Lai","year":"2011","unstructured":"Lai, M.J., Wang, J.: An unconstrained $$\\ell _q$$ \u2113 q minimization with $$0<q\\le 1$$ 0 < q \u2264 1 for sparse solution of underdetermined linear systems. SIAM J. Optim. 21(1), 82\u2013101 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"939_CR45","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 $$l_{q}$$ l q minimization. SIAM J. Numer. Anal. 51(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"939_CR46","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1109\/TSP.2012.2236319","volume":"61","author":"YF Liu","year":"2013","unstructured":"Liu, Y.F., Dai, Y.H., Luo, Z.Q.: Joint power and admission control via linear programming deflation. IEEE Trans. Signal Process. 61(6), 1327\u20131338 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"14","key":"939_CR47","doi-asserted-by":"crossref","first-page":"3641","DOI":"10.1109\/TSP.2015.2428224","volume":"63","author":"YF Liu","year":"2015","unstructured":"Liu, Y.F., Dai, Y.H., Ma, S.: Joint power and admission control: non-convex $$l_q$$ l q approximation and an effective polynomial time deflation approach. IEEE Trans. Signal Process. 63(14), 3641\u20133656 (2015)","journal-title":"IEEE Trans. Signal Process."},{"key":"939_CR48","doi-asserted-by":"crossref","unstructured":"Lu, Z.: Iterative reweighted minimization methods for $$l_p$$ l p regularized unconstrained nonlinear programming. Math. Program. 147(1\u20132), 277\u2013307 (2014)","DOI":"10.1007\/s10107-013-0722-4"},{"issue":"12","key":"939_CR49","doi-asserted-by":"crossref","first-page":"4110","DOI":"10.1109\/TWC.2011.100811.101381","volume":"10","author":"I Mitliagkas","year":"2011","unstructured":"Mitliagkas, I., Sidiropoulos, N.D., Swami, A.: Joint power and admission control for ad-hoc and cognitive underlay networks: convex approximation and distributed implementation. IEEE Trans. Wireless Commun. 10(12), 4110\u20134121 (2011)","journal-title":"IEEE Trans. Wireless Commun."},{"issue":"7","key":"939_CR50","doi-asserted-by":"crossref","first-page":"3485","DOI":"10.1109\/TSP.2010.2046900","volume":"58","author":"N Mourad","year":"2010","unstructured":"Mourad, N., Reilly, J.P.: Minimizing nonconvex functions for sparse vector reconstruction. IEEE Trans. Signal Process. 58(7), 3485\u20133496 (2010)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"939_CR51","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$\\text{ O }(1\/k^2)$$ O ( 1 \/ k 2 ) . Sov. Math. Dokl. 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"issue":"1","key":"939_CR52","doi-asserted-by":"crossref","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. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"939_CR53","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/070692285","volume":"1","author":"M Nikolova","year":"2008","unstructured":"Nikolova, M., Ng, M.K., Zhang, S., Ching, W.K.: Efficient reconstruction of piecewise constant images using nonsmooth nonconvex minimization. SIAM J. Imaging Sci. 1(1), 2\u201325 (2008)","journal-title":"SIAM J. Imaging Sci."},{"key":"939_CR54","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"939_CR55","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Massachusetts (1994)"},{"issue":"1","key":"939_CR56","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/78.738251","volume":"47","author":"BD Rao","year":"1999","unstructured":"Rao, B.D., Kreutz-delgado, K.: An affine scaling methodology for best basis selection. IEEE Trans. Signal Process. 47(1), 187\u2013200 (1999)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"939_CR57","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.acha.2011.07.001","volume":"32","author":"Q Sun","year":"2012","unstructured":"Sun, Q.: Recovery of sparsest signals via $$\\ell _q$$ \u2113 q -minimization. Appl. Comput. Harmon. Anal. 32(3), 329\u2013341 (2012)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"939_CR58","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"key":"939_CR59","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"},{"issue":"2","key":"939_CR60","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-004-0526-7","volume":"101","author":"M Wagner","year":"2004","unstructured":"Wagner, M., Meller, J., Elber, R.: Large-scale linear programming techniques for the design of protein folding potentials. Math. Program. 101(2), 301\u2013318 (2004)","journal-title":"Math. Program."},{"issue":"7","key":"939_CR61","doi-asserted-by":"crossref","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(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"939_CR62","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms-Theory and Analysis","author":"Y Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms-Theory and Analysis. Wiley, New York (1997)"},{"issue":"2","key":"939_CR63","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10589-009-9251-8","volume":"48","author":"S Yun","year":"2011","unstructured":"Yun, S., Toh, K.C.: A coordinate gradient descent method for $$l_1$$ l 1 -regularized convex minimization. Comput. Optim. Appl. 48(2), 273\u2013307 (2011)","journal-title":"Comput. Optim. Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0939-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0939-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0939-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T03:17:33Z","timestamp":1567048653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0939-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,12]]},"references-count":63,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["939"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0939-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,12]]}}}