{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T16:24:37Z","timestamp":1771863877456,"version":"3.50.1"},"reference-count":161,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,8,17]],"date-time":"2010-08-17T00:00:00Z","timestamp":1282003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10107-010-0394-2","type":"journal-article","created":{"date-parts":[[2010,8,16]],"date-time":"2010-08-16T04:58:17Z","timestamp":1281934697000},"page":"263-295","source":"Crossref","is-referenced-by-count":145,"title":["Approximation accuracy, gradient methods, and error bound for structured convex optimization"],"prefix":"10.1007","volume":"125","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,17]]},"reference":[{"key":"394_CR1","first-page":"803","volume":"10","author":"J. Abernethy","year":"2009","unstructured":"Abernethy J., Bach F., Evgeniou T., Vert J.-P.: A new approach to collaborative filtering: operator estimation with spectral regularization. J. Mach. Learn. Res. 10, 803\u2013826 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"394_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0024-3795(00)00066-5","volume":"310","author":"A.Y. Alfakih","year":"2000","unstructured":"Alfakih A.Y.: Graph rigidity via Euclidean distance matrices. Linear Algebra Appl. 310, 149\u2013165 (2000)","journal-title":"Linear Algebra Appl."},{"key":"394_CR3","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10994-007-5040-8","volume":"73","author":"A. Argyriou","year":"2008","unstructured":"Argyriou A., Evgeniou T., Pontil M.: Convex multi-task feature learning. Mach. Learn. 73, 243\u2013272 (2008)","journal-title":"Mach. Learn."},{"key":"394_CR4","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Goldenberg, D., Yang, Y.R.: On the computational complexity of sensor network localization. In: Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004 (Turku, Finland, July 2004), vol. 3121 of Lecture Notes in Computer Science, Springer, pp. 32\u201344","DOI":"10.1007\/978-3-540-27820-7_5"},{"issue":"1","key":"394_CR5","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/060670985","volume":"30","author":"A. D\u2019Aspremont","year":"2008","unstructured":"D\u2019Aspremont A., Banerjee O., Ghaoui L.E.: First-order methods for sparse covariance selection. SIAM J. Matrix Anal. Appl. 30(1), 56\u201366 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"394_CR6","first-page":"429","volume":"3","author":"A. Auslender","year":"1978","unstructured":"Auslender A.: Minimisation sans contraintes de fonctions localement lipschitziennes: Applications \u00e0 la programmation mi-convexe, mi-diff\u00e9rentiable. Nonlinear Program. 3, 429\u2013460 (1978)","journal-title":"Nonlinear Program."},{"key":"394_CR7","doi-asserted-by":"crossref","unstructured":"Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104 (2005)","DOI":"10.1007\/s10107-004-0568-x"},{"key":"394_CR8","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A. Auslender","year":"2006","unstructured":"Auslender A., Teboulle M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"394_CR9","first-page":"485","volume":"9","author":"O. Banerjee","year":"2008","unstructured":"Banerjee O., Ghaoui L.E., D\u2019Aspremont A.: Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data. J. Mach. Learn. Res. 9, 485\u2013516 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"394_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s00365-007-9003-x","volume":"28","author":"R. Baraniuk","year":"2008","unstructured":"Baraniuk R., Davenport M., DeVore R., Wakin M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28(3), 253\u2013263 (2008)","journal-title":"Constr. Approx."},{"issue":"2","key":"394_CR11","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/S0363012902407120","volume":"42","author":"H.H. Bauschke","year":"2003","unstructured":"Bauschke H.H., Borwein J.M., Combettes P.L.: Bregman monotone optimization algorithms. SIAM J. Control Optim. 42(2), 596\u2013636 (2003)","journal-title":"SIAM J. Control Optim."},{"key":"394_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0167-6377(02)00231-6","volume":"31","author":"A. Beck","year":"2003","unstructured":"Beck A., Teboulle M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31, 167\u2013175 (2003)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"394_CR13","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1287\/moor.1060.0193","volume":"31","author":"A. Beck","year":"2006","unstructured":"Beck A., Teboulle M.: A linearly convergent dual-based gradient projection algorithm for quadratically constrained convex minimization. Math. Oper. Res. 31(2), 398\u2013417 (2006). doi: 10.1287\/moor.1060.0193","journal-title":"Math. Oper. Res."},{"key":"394_CR14","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. Technical report, Department of Industrial Engineering and Management, Technion, Haifa (2008)"},{"key":"394_CR15","unstructured":"Becker, S., Bobin, J., Cand\u00e9s, E.: Nesta: a fast and accurate first-order method for sparse recovery. Technical report, California Institute of Technology, April (2009)"},{"key":"394_CR16","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas D.P.: Nonlinear Programming. 2nd edn. Athena Scientific, Belmont, MA (1999)","edition":"2"},{"key":"394_CR17","unstructured":"Biswas, P., Aghajan, H., Ye, Y.: Semidefinite programming algorithms for sensor network localization using angle of arrival information. In: Proceedings of 39th Annual Asiloinar Conference on Signals, Systems, and Computers (Pacific Grove, CA, 2005)"},{"key":"394_CR18","doi-asserted-by":"crossref","unstructured":"Biswas, P., Liang, T.-C., Toh, K.-C., Wang, T.-C., Ye, Y.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. Autom. Sci. Eng. IEEE Trans. 3 (2006)","DOI":"10.1109\/TASE.2006.877401"},{"key":"394_CR19","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P. Biswas","year":"2006","unstructured":"Biswas P., Liang T.-C., Wang T.-C., Ye Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Netw. 2, 188\u2013220 (2006)","journal-title":"ACM Trans. Sens. Netw."},{"issue":"3","key":"394_CR20","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1137\/05062754X","volume":"30","author":"P. Biswas","year":"2008","unstructured":"Biswas P., Toh K.-C., Ye Y.: A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM J. Sci. Comput. 30(3), 1251\u20131277 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"394_CR21","unstructured":"Biswas, P., Ye, Y.: Multiscale optimization methods and applications, vol. 82 of Nonconvex optimization and its applications. Springer, 2003, ch. A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization."},{"key":"394_CR22","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (2004)","DOI":"10.1145\/984622.984630"},{"key":"394_CR23","doi-asserted-by":"crossref","unstructured":"Blatt, D., Hero, A.O., Gauchman, H.: A convergent incremental gradient method with a constant step size. SIAM J. Optim. 18 (2007)","DOI":"10.1137\/040615961"},{"key":"394_CR24","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L. Bregman","year":"1967","unstructured":"Bregman L.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"394_CR25","unstructured":"Cai, J.-F., Cand\u00e9s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. Report, California Institute of Technology, Pasadena, September (2008)"},{"issue":"9\u201310","key":"394_CR26","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"E. Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s E.: The restricted isometry property and its implications for compressed sensing. Comptes rendus-Math\u00e9matique 346(9\u201310), 589\u2013592 (2008)","journal-title":"Comptes rendus-Math\u00e9matique"},{"key":"394_CR27","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. To appear in Found. of Comput. Math. (2008)","DOI":"10.1109\/ALLERTON.2008.4797640"},{"issue":"2","key":"394_CR28","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E.J., Romberg J., Tao T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52(2), 489\u2013509 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"394_CR29","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s E.J., Romberg J., Tao T.: Stable signal recovery from incomplete and inaccurate measurements. Commun. Pure Appl. Math. 59(8), 1207\u20131223 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"12","key":"394_CR30","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","volume":"51","author":"E.J. Cand\u00e8s","year":"2005","unstructured":"Cand\u00e8s E.J., Tao T.: Decoding by linear programming. IEEE Trans. Inform. Theory 51(12), 4203\u20134215 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"394_CR31","doi-asserted-by":"crossref","first-page":"1102","DOI":"10.1137\/040621600","volume":"17","author":"M.W. Carter","year":"2006","unstructured":"Carter M.W., Jin H.H., Saunders M.A., Ye Y.: Spaseloc: an adaptive subproblem algorithm for scalable wireless sensor network localization. SIAM J. Optim. 17(4), 1102\u20131128 (2006)","journal-title":"SIAM J. Optim."},{"key":"394_CR32","volume-title":"Parallel Optimization: Theory, Algoritluns, and Applications","author":"Y. Censor","year":"1997","unstructured":"Censor Y., Zenios S.: Parallel Optimization: Theory, Algoritluns, and Applications. Oxford University Press, New York (1997)"},{"key":"394_CR33","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/0803026","volume":"3","author":"G. Chen","year":"1993","unstructured":"Chen G., Teboulle M.: Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3, 538\u2013543 (1993)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"394_CR34","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen S.S., Donoho D.L., Saunders M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20(1), 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"394_CR35","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1287\/opre.28.6.1385","volume":"28","author":"B. Dasarathy","year":"1980","unstructured":"Dasarathy B., White L.J.: A maxmin location problem. Oper. Res. 28(6), 1385\u20131401 (1980)","journal-title":"Oper. Res."},{"key":"394_CR36","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I. Daubechies","year":"2004","unstructured":"Daubechies I., Defrise M., Mol C.D.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57, 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math."},{"key":"394_CR37","doi-asserted-by":"crossref","unstructured":"Davies, M.E., Gribonval, R.: Restricted isometry constants where \u2113 p sparse recovery can fail for 0\u00a0<\u00a0p\u00a0\u2264\u00a01. Publication interne 1899, Institut de Recherche en Informatique et Syst\u00e9mes Al\u00e9atoires, July (2008)","DOI":"10.1109\/TIT.2009.2016030"},{"key":"394_CR38","doi-asserted-by":"crossref","unstructured":"Ding, Y., Krislock, N., Qian, J., Wolkowicz, H.: Sensor network localization, euclidean distance matrix completions, and graph realization. Technical report, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, February (2008)","DOI":"10.1145\/1410012.1410042"},{"key":"394_CR39","doi-asserted-by":"crossref","unstructured":"Doherty, L., Pister, K.S.J., El Ghaoui, L.: Convex position estimation in wireless sensor networks. In: Proceedings of 20th INFOCOM, vol. 3 (2001)","DOI":"10.1109\/INFCOM.2001.916662"},{"key":"394_CR40","doi-asserted-by":"crossref","unstructured":"Donoho, D.L.: For most large underdetermined systems of linear equations the minimal l1-norm near-solution approximates the sparsest near-solution. Technical report, Department of Statistics, Stanford University, Stanford (2006)","DOI":"10.1002\/cpa.20131"},{"key":"394_CR41","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1002\/cpa.20132","volume":"59","author":"D.L. Donoho","year":"2006","unstructured":"Donoho D.L.: For most large underdetermined systems of linear equations, the minimal l1-norm solution is also the sparsest solution. Commun. Pure Appl. Math. 59, 797\u2013829 (2006)","journal-title":"Commun. Pure Appl. Math."},{"issue":"5","key":"394_CR42","doi-asserted-by":"crossref","first-page":"2197","DOI":"10.1073\/pnas.0437847100","volume":"100","author":"D.L. Donoho","year":"2003","unstructured":"Donoho D.L., Elad M.: Optimally sparse representation in general (nonorthogonal) dictionaries via \u2113 1 minimization. Proc. Natl. Acad. Sci. USA 100(5), 2197\u20132202 (2003)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"394_CR43","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TIT.2005.860430","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho D.L., Elad M., Temlyakov V.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52(1), 6\u201318 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"394_CR44","doi-asserted-by":"crossref","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"D.L. Donoho","year":"2001","unstructured":"Donoho D.L., Huo X.: Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47(7), 2845\u20132862 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"394_CR45","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/81.3.425","volume":"81","author":"D.L. Donoho","year":"1994","unstructured":"Donoho D.L., Johnstone I.M.: Ideal spatial adaptation by wavelet shrinkage. Biometrika 81(3), 425\u2013455 (1994)","journal-title":"Biometrika"},{"issue":"432","key":"394_CR46","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1080\/01621459.1995.10476626","volume":"90","author":"D.L. Donoho","year":"1995","unstructured":"Donoho D.L., Johnstone I.M.: Adapting to unknown smoothness via wavelet shrinkage. J. Am. Stat. Assoc. 90(432), 1200\u20131224 (1995)","journal-title":"J. Am. Stat. Assoc."},{"key":"394_CR47","unstructured":"Donoho, D.L., Tsaig, Y., Drori, I., Starck, J.-L.: Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit. Tech. Rep. 2006\u20132, Dept. of Statistics, Stanford University, April (2006)"},{"issue":"1","key":"394_CR48","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1287\/moor.18.1.202","volume":"18","author":"J. Eckstein","year":"1993","unstructured":"Eckstein J.: Nonlinear proximal point algorithms using bregman functions, with applications to convex programming. Math. Oper. Res. 18(1), 202\u2013226 (1993)","journal-title":"Math. Oper. Res."},{"key":"394_CR49","doi-asserted-by":"crossref","unstructured":"Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.: Rigidity, computation, and randomization in network localization. In: 23rd INFOCOM, vol. 4. (2004)","DOI":"10.1109\/INFCOM.2004.1354686"},{"key":"394_CR50","doi-asserted-by":"crossref","unstructured":"Evgeniou, T., Pontil, M.: Regularized multi-task learning. In: Proceedings of 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2004)","DOI":"10.1145\/1014052.1014067"},{"key":"394_CR51","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I and II","author":"F. Facchinei","year":"2003","unstructured":"Facchinei F., Pang J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. I and II. Springer, New York (2003)"},{"key":"394_CR52","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: A rank minimization heuristic with application to minimum order system approximation. In: Proceedings of American Control Conference (Arlington, 2001)","DOI":"10.1109\/ACC.2001.945730"},{"key":"394_CR53","doi-asserted-by":"crossref","unstructured":"Ferris, M.C., Mangasarian, O.L.: Parallel variable distribution. SIAM J. Optim. 4 (1994)","DOI":"10.1137\/0804047"},{"key":"394_CR54","volume-title":"Algorithms for Continuous Optimization","author":"R. Fletcher","year":"1994","unstructured":"Fletcher R.: An overview of unconstrained optimization. In: Spedicato, E. (ed.) Algorithms for Continuous Optimization, Kluwer Academic, Dordrecht (1994)"},{"key":"394_CR55","doi-asserted-by":"crossref","unstructured":"Friedman J., Hastie T., H\u00f6fling H., Tihshirani R.: Pathwise coordinate optimization. Ann. Appl. Stat. 1, (2007)","DOI":"10.1214\/07-AOAS131"},{"key":"394_CR56","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics (2007)","DOI":"10.1093\/biostatistics\/kxm045"},{"key":"394_CR57","unstructured":"Friedman, J., Hastie, T., Tihshirani, R.: Regularization paths for generalized linear models via coordinate descent. Report, Department of Statistics, Stanford University, Stanford, July (2008)"},{"issue":"6","key":"394_CR58","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1109\/TIT.2004.828141","volume":"50","author":"J.-J. Fuchs","year":"2004","unstructured":"Fuchs J.-J.: On sparse representations in arbitrary redundant bases. IEEE Trans. Inform. Theory 50(6), 1341\u20131344 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"394_CR59","doi-asserted-by":"crossref","unstructured":"Fuchs, J.-J.: Recovery of exact sparse representations in the presence of bounded noise. IEEE Trans. Inform. Theory 51 (2005)","DOI":"10.1109\/TIT.2005.855614"},{"key":"394_CR60","doi-asserted-by":"crossref","unstructured":"Fukushima, M.: Parallel variable transformation in unconstrained optimization. SIAM J. Optim. 8 (1998)","DOI":"10.1137\/S1052623496309879"},{"key":"394_CR61","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M. Fukushima","year":"1981","unstructured":"Fukushima M., Mine H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12, 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"394_CR62","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.J.: Approximation of functions over redundant dictionaries using coherence. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms (New York, 2003), ACM"},{"key":"394_CR63","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Yin, W.: Second-order cone programming methods for total variation-based image restoration. SIAM J. Sci. Comput. 27 (2005)","DOI":"10.1137\/040608982"},{"key":"394_CR64","unstructured":"Gonzaga, C.C., Karas, E.W.: Optimal steepest descent algorithms for unconstrained convex problems: fine timing nesterov\u2019s method. Technical report, Departnient of Mathematics, Federal University of Santa Catarina, Florian\u00f3polis, August (2008)"},{"issue":"12","key":"394_CR65","doi-asserted-by":"crossref","first-page":"3320","DOI":"10.1109\/TIT.2003.820031","volume":"49","author":"R. Gribonval","year":"2003","unstructured":"Gribonval R., Nielsen M.: Sparse representations in unions of bases. IEEE Trans. Inform. Theory 49(12), 3320\u20133325 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"394_CR66","unstructured":"Hale, E., Yin, W., Zhang, Y.: A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing. Tech. Rep. TR07-07, Department of Computational and Applied Mathematics, Rice University, Houston, TX (2007)"},{"key":"394_CR67","unstructured":"Hoda, S., Gilpin, A., Pefla, J.: Smoothing techniques for computing nash equilibria of sequential games. Technical report, Carnegie Mellon University, Pittsburg, March (2008)"},{"key":"394_CR68","unstructured":"Juditsky, A., Lan, G., Nemirovski, A., Shapiro, A.: Stochastic approximation approach to stochastic programming. Technical report, to appear in SIAM J. Optim. (2007)"},{"key":"394_CR69","unstructured":"Kim, S., Kojima, M., Waki, H.: Exploiting sparsity in sdp relaxation for sensor network localization, report b-447. Technical report, Tokyo Institute of Technology, Tokyo, October (2008)"},{"key":"394_CR70","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.C.: Proximal minimization methods with generalized bregman functions. SIAM J. Control Optim. 35 (1997)","DOI":"10.1137\/S0363012995281742"},{"key":"394_CR71","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/S1052623400376366","volume":"14","author":"K.C. Kiwiel","year":"2003","unstructured":"Kiwiel K.C.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. Optim. 14, 807\u2013840 (2003)","journal-title":"SIAM J. Optim."},{"key":"394_CR72","doi-asserted-by":"crossref","unstructured":"Kiwiel, K.C.: On linear-time algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 134 (2007)","DOI":"10.1007\/s10957-007-9259-0"},{"key":"394_CR73","unstructured":"Krislock, N., Piccialli, V., Wolkowicz, H.: Robust semidefinite programming approaches for sensor network localization with anchors. Technical report, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, May (2006)"},{"key":"394_CR74","doi-asserted-by":"crossref","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with o(1\/e)o(1\/\u03b5) iteration-complexity for cone programming. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, December (2006)","DOI":"10.1007\/s10107-008-0261-6"},{"key":"394_CR75","unstructured":"Liang, T.-C., Wang, T.-C., Ye, Y.: A gradient search method to round the semidefinite programming relaxation solution for ad hoc wireless sensor network localization. Technical report, Electrical Engineering, Stanford University, October (2004)"},{"key":"394_CR76","unstructured":"Liu, Z., Vandenberghe, L.: Interior-point method for nuclear norm approximation with application to system identification. Technical report, Electrical Engineering Department, UCLA, Los Angeles (2008)"},{"key":"394_CR77","unstructured":"Lu, Z.: Smooth optimization approach for sparse covariance selection. Technical report, Department of Mathematics, Simon Fraser University, Burnaby, January 2008. submitted to SIAM J. Optim"},{"key":"394_CR78","unstructured":"Lu, Z., Monteiro, R.D.C., Yuan, M.: Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, January 2008. revised March (2009)"},{"key":"394_CR79","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q.: On the convergence of the lms algorithm with adaptive learning rate for linear feedforward networks. Neural Comput. 3 (1991)","DOI":"10.1162\/neco.1991.3.2.226"},{"key":"394_CR80","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30 (1992)","DOI":"10.1137\/0330025"},{"key":"394_CR81","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46 (1993)","DOI":"10.1007\/BF02096261"},{"key":"394_CR82","doi-asserted-by":"crossref","unstructured":"Luo, Z.Q., Tseng, P.: On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18 (1993)","DOI":"10.1287\/moor.18.4.846"},{"key":"394_CR83","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Report 08\u201378, UCLA Computational and Applied Mathematics (2008)"},{"key":"394_CR84","doi-asserted-by":"crossref","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. Signal Process. IEEE Trans. 41 (1993)","DOI":"10.1109\/78.258082"},{"key":"394_CR85","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0305-0548(69)90004-5","volume":"11","author":"O.L. Mangasarian","year":"1984","unstructured":"Mangasarian O.L.: Sparsity-preserving sor algorithms for separable quadratic and linear programming. Comnput. Oper. Res. 11, 105\u2013112 (1984)","journal-title":"Comnput. Oper. Res."},{"key":"394_CR86","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L.: Mathematical programming in neural networks. ORSA J. Comput. 5 (1993)","DOI":"10.1287\/ijoc.5.4.349"},{"key":"394_CR87","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1137\/S0363012993250220","volume":"33","author":"O.L. Mangasarian","year":"1995","unstructured":"Mangasarian O.L.: Parallel gradient distribution in unconstrained optimization. SIAM J. Control Optim. 33, 1916\u20131925 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"394_CR88","doi-asserted-by":"crossref","unstructured":"Mangasarian, O.L., Musicant, D.R.: Successive over relaxation for support vector machines. IEEE Trans. Neural Netw. 10 (1999)","DOI":"10.1109\/72.788643"},{"key":"394_CR89","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"B 70","author":"L. Meier","year":"2008","unstructured":"Meier L., van de Geer S., B\u00fchlmann P.: The group Lasso for logistic regression. J. Royal Statist. Soc. B 70, 53\u201371 (2008)","journal-title":"J. Royal Statist. Soc."},{"key":"394_CR90","doi-asserted-by":"crossref","unstructured":"More, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7 (1997)","DOI":"10.1137\/S1052623495283024"},{"key":"394_CR91","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12 (2001)","DOI":"10.1137\/S1052623499362111"},{"key":"394_CR92","doi-asserted-by":"crossref","unstructured":"Nemirovski, A.: Prox-method with rate of convergence o(1\/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15 (2005)","DOI":"10.1137\/S1052623403425629"},{"key":"394_CR93","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A. Nemirovski","year":"1983","unstructured":"Nemirovski A., Yudin D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"394_CR94","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence o(1\/k 2). Doklady AN SSSR 269 (1983). translated as Soviet Math. Dokl"},{"key":"394_CR95","unstructured":"Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonom. i. Mat. Metody 24 (1988)"},{"key":"394_CR96","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Y. Nesterov","year":"2004","unstructured":"Nesterov Y.: Introductory Lectures on Convex Optimization. Kluwer Academic Publisher, Dordrecht, The Netherlands (2004)"},{"key":"394_CR97","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Technical report, CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium, October (2004)","DOI":"10.2139\/ssrn.683135"},{"key":"394_CR98","doi-asserted-by":"crossref","unstructured":"Nesterov, Y. Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16 (2005)","DOI":"10.1137\/S1052623403422285"},{"key":"394_CR99","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 nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"394_CR100","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Technical report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (2007)"},{"key":"394_CR101","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Technical report, CORE, Catholic University of Louvain, Louvain-la-Neuve, Belgium, September (2007)"},{"key":"394_CR102","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y. Nesterov","year":"2007","unstructured":"Nesterov Y.: Primal-dual subgradient methods for convex problems. Math. Program. 120, 221\u2013259 (2007). doi: 10.1007\/s10107-007-0149-x","journal-title":"Math. Program."},{"key":"394_CR103","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.E., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming, vol. 13 of Stud. Appl. Math. Society of Industrial and Applied Mathematics, Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"394_CR104","unstructured":"Nie, J.: Sum of squares method for sensor network localization. Technical report, Department of Mathematics, University of California, Berkeley, June 2006. to appear in Comput. Optim. Appl"},{"key":"394_CR105","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"394_CR106","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s11222-008-9111-x","volume":"20","author":"G. Obozinski","year":"2009","unstructured":"Obozinski G., Taskar B., Jordan M.I.: Joint covariate selection and joint subspace selection for multiple classification problems. Stat. Comput. 20, 231\u2013252 (2009)","journal-title":"Stat. Comput."},{"key":"394_CR107","volume-title":"Iterative Solutions of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega J.M., Rheinboldt W.C.: Iterative Solutions of Nonlinear Equations in Several Variables. Academic Press, London (1970)"},{"key":"394_CR108","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1080\/10618600.2000.10474883","volume":"9","author":"M.R. Osborne","year":"2000","unstructured":"Osborne M.R., Presnell B., Turlach B.A.: On the LASSO and its dual. J. Comput. Graph. Stat. 9, 319\u2013337 (2000)","journal-title":"J. Comput. Graph. Stat."},{"key":"394_CR109","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1137\/040605412","volume":"4","author":"S. Osher","year":"2005","unstructured":"Osher S., Burger M., Goldfarb D., Xu J.: An iterative regularization method for total variation-based image restoration. SIAM J. Multiscale Model. Simul. 4, 460\u2013489 (2005)","journal-title":"SIAM J. Multiscale Model. Simul."},{"key":"394_CR110","doi-asserted-by":"crossref","unstructured":"Pang, J.-S.: A posteriori error bounds for the linearly constrained variational inequality problem. Math. Oper. Res. 12 (1987)","DOI":"10.1287\/moor.12.3.474"},{"key":"394_CR111","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/j.1467-9868.2007.00607.x","volume":"69","author":"M.-Y. Park","year":"2007","unstructured":"Park M.-Y., Hastie T.: An L1 regularization-path algorithm for generalized linear models. J. Roy. Soc. Stat. B 69, 659\u2013677 (2007)","journal-title":"J. Roy. Soc. Stat. B"},{"key":"394_CR112","doi-asserted-by":"crossref","unstructured":"Pfander, G.B., Rauhut, H., Tanner, J. Identification of matrices having a sparse representation. IEEE Trans. Signal Proc. 56 (2008)","DOI":"10.1109\/TSP.2008.928503"},{"key":"394_CR113","doi-asserted-by":"crossref","unstructured":"Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel Methods: Support Vector Learning. MIT Press, Cambridge, MA, USA (1998)","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"394_CR114","volume-title":"Introduction to optimization","author":"B.T. Polyak","year":"1987","unstructured":"Polyak B.T.: Introduction to optimization. Optimization Software, New York (1987)"},{"key":"394_CR115","doi-asserted-by":"crossref","unstructured":"Pong, T.K., Tseng, P.: (robust) edge-based semidefinite programming relaxation of sensor network localization. Technical report, Department of Mathematics, University of Washington, Seattle, January (2009)","DOI":"10.1007\/s10107-009-0338-x"},{"key":"394_CR116","doi-asserted-by":"crossref","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42 (1994)","DOI":"10.1287\/opre.42.2.299"},{"key":"394_CR117","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. arXiv 0706.4138, June (2007)"},{"key":"394_CR118","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"394_CR119","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar R.T., Wets R.J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"394_CR120","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0076-6879(04)83004-0","volume":"383","author":"C.A. Rohl","year":"2004","unstructured":"Rohl C.A., Strauss C.E.M., Misura K., Baker D.: Protein structure prediction using rosetta. Methods Enzym. 383, 66\u201393 (2004)","journal-title":"Methods Enzym."},{"key":"394_CR121","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1014890403681","volume":"22","author":"C.A. Sagastizabal","year":"2002","unstructured":"Sagastizabal C.A., Solodov M.V.: Parallel variable distribution for constrained optimization. Comput. Optim. Appl. 22, 111\u2013131 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"394_CR122","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1198\/1061860043399","volume":"13","author":"S. Sardy","year":"2004","unstructured":"Sardy S., Antoniadis A., Tseng P.: Automatic smoothing with wavelets for a wide class of distributions. J. Comput. Graph. Stat. 13, 399\u2013421 (2004)","journal-title":"J. Comput. Graph. Stat."},{"key":"394_CR123","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/10618600.2000.10474885","volume":"9","author":"S. Sardy","year":"2000","unstructured":"Sardy S., Bruce A., Tseng P.: Block coordinate relaxation methods for nonparametric wavelet denoising. J. Comput. Graph. Stat. 9, 361\u2013379 (2000)","journal-title":"J. Comput. Graph. Stat."},{"key":"394_CR124","doi-asserted-by":"crossref","unstructured":"Sardy, S., Bruce, A., Tseng, P.: Robust wavelet denoising. IEEE Trans. Signal Proc. 49 (2001)","DOI":"10.1109\/78.923297"},{"key":"394_CR125","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1198\/1061860043434","volume":"13","author":"S. Sardy","year":"2004","unstructured":"Sardy S., Tseng P.: AMlet, RAMlet, and GAMlet: automatic nonlinear fitting of additive models, robust and generalized, with wavelets. J. Comput. Graph. Stat. 13, 283\u2013309 (2004)","journal-title":"J. Comput. Graph. Stat."},{"key":"394_CR126","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1198\/016214504000000188","volume":"99","author":"S. Sardy","year":"2004","unstructured":"Sardy S., Tseng P.: On the statistical analysis of smoothing by maximizing dirty markov random field posterior distributions. J. Amer. Statist. Assoc. 99, 191\u2013204 (2004)","journal-title":"J. Amer. Statist. Assoc."},{"key":"394_CR127","unstructured":"Shi, J., Yin, W., Osher, S., Sajda, P.: A fast algorithm for large scale L1-regularized logistic regression. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston (2008)"},{"key":"394_CR128","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"A.M.-C. So","year":"2007","unstructured":"So A.M.-C., Ye Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109, 367\u2013384 (2007)","journal-title":"Math. Program."},{"key":"394_CR129","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1018366000512","volume":"11","author":"M.V. Solodov","year":"1998","unstructured":"Solodov M.V.: Incremental gradient algorithms with step sizes bounded away from zero. Comput. Optim. Appl. 11, 23\u201325 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"394_CR130","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1063-5203(03)00023-X","volume":"14","author":"T. Strohmer","year":"2003","unstructured":"Strohmer T., Heath R.J.: Grassmannian frames with applications to coding and communications. Appl. Comp. Harm. Anal. 14, 257\u2013275 (2003)","journal-title":"Appl. Comp. Harm. Anal."},{"key":"394_CR131","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970524","volume-title":"Conjugate Duality and Optimization","author":"R.T. Rockafellar","year":"1974","unstructured":"Rockafellar R.T.: Conjugate Duality and Optimization. Society for Industrial and Applied Mathematics, Philadelphia (1974)"},{"key":"394_CR132","doi-asserted-by":"crossref","unstructured":"Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7 (1997)","DOI":"10.1137\/S1052623495292130"},{"key":"394_CR133","unstructured":"Toh K.-C., Yun, S.: An accelerated proximal gradient algorithm for nuclear regularized least squares problems. Technical report, Department of Mathematics, National University of Singapore, Singapore (2009)"},{"key":"394_CR134","unstructured":"Toh, S. Y. K.-C.: A coordinate gradient descent method for l1-regularized convex minimization. Technical report, Department of Mathematics, National University of Singapore, Singapore, 2008. submitted to Comput. Optim. Appl"},{"issue":"10","key":"394_CR135","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J.A. Tropp","year":"2004","unstructured":"Tropp J.A.: Greed is good: algorithmic results for sparse approximation. IEEE Trans. Inform. Theory 50(10), 2231\u20132242 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"394_CR136","doi-asserted-by":"crossref","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"J.A. Tropp","year":"2006","unstructured":"Tropp J.A.: Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inform. Theory 52(3), 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"12","key":"394_CR137","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","volume":"53","author":"J.A. Tropp","year":"2007","unstructured":"Tropp J.A., Gilbert A.C.: Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans. Inform. Theory 53(12), 4655\u20134666 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"394_CR138","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01581245","volume":"59","author":"P. Tseng","year":"1993","unstructured":"Tseng P.: Dual coordinate descent methods for non-strictly convex minimization. Math. Prog. 59, 231\u2013247 (1993)","journal-title":"Math. Prog."},{"key":"394_CR139","doi-asserted-by":"crossref","unstructured":"Tseng, P.: An incremental gradient(-projection) method with momentum term and adaptive stepsize rule. SIAM J. Optim. 8 (1998)","DOI":"10.1137\/S1052623495294797"},{"key":"394_CR140","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Nonlinear Optimization and Related Topics. Kiuwer, Dordrecht, 2000, ch. Error bounds and superlinear convergence analysis of sonic Newton-type methods in optimization","DOI":"10.1007\/978-1-4757-3226-9_24"},{"key":"394_CR141","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P. Tseng","year":"2001","unstructured":"Tseng P.: Convergence of block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109, 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"394_CR142","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Second-order cone programming relaxation of sensor network localization. SIAM J. Optim. 18 (2007)","DOI":"10.1137\/050640308"},{"key":"394_CR143","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex-concave optimization. Technical report, Department of Mathematics, University of Washington, Seattle, May 2008. submitted to SIAM J. Optim"},{"key":"394_CR144","doi-asserted-by":"crossref","unstructured":"Tseng, P.: Further results on a stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inf. Theory. 55 (2009)","DOI":"10.1109\/TIT.2008.2009812"},{"key":"394_CR145","doi-asserted-by":"crossref","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. (2008)","DOI":"10.1007\/s10589-008-9215-4"},{"key":"394_CR146","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P. Tseng","year":"2009","unstructured":"Tseng P., Yun S.: A block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140, 513\u2013535 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"394_CR147","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P. Tseng","year":"2009","unstructured":"Tseng P., Yun S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"394_CR148","unstructured":"Wang, Y., Yang, J., Yin, W., Zhang, Y.: A new alternating minimization algorithm for total variation image reconstruction. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston, 2007. to appear in SIAM Imaging Sci"},{"key":"394_CR149","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zheng, S., Ye, Y., Boyd, S.: Further relaxations of the semidefinite programming approach to sensor network localization. SIAM J. Optim. 19 (2008)","DOI":"10.1137\/060669395"},{"key":"394_CR150","doi-asserted-by":"crossref","unstructured":"White, D.J.: A heuristic approach to a weighted maxmin dispersion problem. IMA J. Manag. Math. 9 (1996)","DOI":"10.1093\/imaman\/7.3.219"},{"key":"394_CR151","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"Wright S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"394_CR152","doi-asserted-by":"crossref","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. Technical report, Computer Sciences Department, University of Wisconsin, Madison, October (2007)","DOI":"10.1109\/ICASSP.2008.4518374"},{"key":"394_CR153","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, Y., Yin, W.: An efficient TVL1 algorithm for deblurring multichannel images corrupted by impulsive noise. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston (2008)","DOI":"10.1137\/080732894"},{"key":"394_CR154","first-page":"719","volume":"9","author":"J. Ye","year":"2008","unstructured":"Ye J., Ji S., Chen J.: Multi-class discriminant kernel learning via convex programming. J. Mach. Learn. Res. 9, 719\u2013758 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"394_CR155","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. John Wiley & Sons, New York (1997)"},{"key":"394_CR156","doi-asserted-by":"crossref","unstructured":"Yin, W., Osher, S., Goldfarb, D., Darbon, J.: Bregman iterative algorithms for l1 minimization with applications to compressed sensing. SIAM J. Imaging Sci. 1 (2008)","DOI":"10.1137\/070703983"},{"key":"394_CR157","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1111\/j.1467-9868.2007.00591.x","volume":"69","author":"M. Yuan","year":"2007","unstructured":"Yuan M., Ekici A., Lu Z., Monteiro R.: Dimension reduction and coefficient estimation in multivariate linear regression. J. Royal Stat. Soc. B. 69, 329\u2013346 (2007)","journal-title":"J. Royal Stat. Soc. B."},{"key":"394_CR158","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M. Yuan","year":"2006","unstructured":"Yuan M., Lin Y.: Model selection and estimation in regression with grouped variables. J. Royal Stat. Soc. B. 68, 49\u201367 (2006)","journal-title":"J. Royal Stat. Soc. B."},{"key":"394_CR159","doi-asserted-by":"crossref","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in the gaussian graphical model. Biometrika 94 (2007)","DOI":"10.1093\/biomet\/asm018"},{"key":"394_CR160","unstructured":"Zhu, M., Chan, T.F.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. Technical report, Department of Mathematics, UCLA, Los Angeles (2008)"},{"key":"394_CR161","doi-asserted-by":"crossref","unstructured":"Zhu, M., Wright, S.J., Chan, T.F.: Duality-based algorithms for total-variation regularized image restoration. Technical report, Department of Mathematics, UCLA, Los Angeles (2008)","DOI":"10.1007\/s10589-008-9225-2"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0394-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0394-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0394-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T15:32:54Z","timestamp":1740411174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0394-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,17]]},"references-count":161,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["394"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0394-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,17]]}}}