{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,28]],"date-time":"2024-06-28T18:20:50Z","timestamp":1719598850856},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:00:00Z","timestamp":1489449600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s11075-017-0297-x","type":"journal-article","created":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T02:33:10Z","timestamp":1489458790000},"page":"1071-1097","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal subgradient algorithms for large-scale convex optimization in simple domains"],"prefix":"10.1007","volume":"76","author":[{"given":"Masoud","family":"Ahookhosh","sequence":"first","affiliation":[]},{"given":"Arnold","family":"Neumaier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,14]]},"reference":[{"key":"297_CR1","unstructured":"Ahookhosh, M.: Optimal subgradient algorithms with application to large-scale linear inverse problems, Submitted (2015), arXiv: 1402.7291"},{"key":"297_CR2","unstructured":"Ahookhosh, M.: High-dimensional nonsmooth convex optimization via optimal subgradient methods. PhD Thesis, University of Vienna, pp. 1\u2013206 (2015)"},{"key":"297_CR3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.apm.2016.10.055","volume":"43","author":"M Ahookhosh","year":"2017","unstructured":"Ahookhosh, M., Ghaderi, S.: On efficiency of nonmonotone Armijo-type line searches. Appl. Math. Model. 43, 170\u2013190 (2017)","journal-title":"Appl. Math. Model."},{"key":"297_CR4","unstructured":"Ahookhosh, M., Neumaier, A.: High-dimensional convex optimization via optimal affine subgradient algorithms. In: ROKS workshop, pp. 83\u201384 (2013)"},{"key":"297_CR5","unstructured":"Ahookhosh, M., Neumaier, A.: An optimal subgradient algorithm with subspace search for costly convex optimization problems, submitted, http:\/\/www.optimization-online.org\/DB_FILE\/2015\/04\/4852.pdf (2016)"},{"key":"297_CR6","unstructured":"Ahookhosh, M., Neumaier, A.: An optimal subgradient algorithm for large-scale bound-constrained convex optimization, submitted, arXiv: 1501.01497 (2015)"},{"key":"297_CR7","unstructured":"Ahookhosh, M., Neumaier, A.: Solving nonsmooth convex optimization with complexity o(\u03b5 \u22121\/2), submitted, http:\/\/www.optimization-online.org\/DB_FILE\/2015\/05\/4900.pdf (2016)"},{"key":"297_CR8","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11075-013-9723-x","volume":"66","author":"K Amini","year":"2014","unstructured":"Amini, K., Ahookhosh, M., Nosratipour, H.: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization. Numerical Algorithms 66, 49\u201378 (2014)","journal-title":"Numerical Algorithms"},{"key":"297_CR9","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":"297_CR10","doi-asserted-by":"crossref","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory, Practice and Software, Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-08114-4"},{"key":"297_CR11","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1137\/S1064827502410451","volume":"25","author":"J Bardsley","year":"2003","unstructured":"Bardsley, J., Vogel, C.R.: A nonnegatively constrained convex programming method for image reconstruction. SIAM J. Sci. Comput. 25, 1326\u20131343 (2003)","journal-title":"SIAM J. Sci. Comput."},{"key":"297_CR12","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 method. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"297_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/100818327","volume":"22","author":"A Beck","year":"2012","unstructured":"Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim. 22, 557\u2013580 (2012)","journal-title":"SIAM J. Optim."},{"key":"297_CR14","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, 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"297_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s12532-011-0029-5","volume":"3","author":"SR Becker","year":"2011","unstructured":"Becker, S.R., Cand\u00e8s, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput. 3, 165\u2013218 (2011)","journal-title":"Math. Program. Comput."},{"key":"297_CR16","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear programming, 2nd ed. Athena Scientific, Belmont (1999)","edition":"2nd ed."},{"key":"297_CR17","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Gradient convergence in gradient methods with errors. SIAM J. Optim. 10, 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"key":"297_CR18","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Martinez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"297_CR19","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10589-012-9523-6","volume":"54","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Hendrich, C.: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems. Comput. Optim. Appl. 54(2), 239\u2013262 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"297_CR20","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1137\/120901106","volume":"23","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Hendrich, C.: A Douglas-Rachford type primal-dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators. SIAM J. Optim. 23(4), 2541\u20132565 (2013)","journal-title":"SIAM J. Optim."},{"key":"297_CR21","doi-asserted-by":"crossref","first-page":"2011","DOI":"10.1137\/12088255X","volume":"23","author":"RI Bo\u0163","year":"2013","unstructured":"Bo\u0163, R.I., Csetnek, E. R., Hendrich, C.: A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators. SIAM J. Optim. 23, 2011\u20132036 (2013)","journal-title":"SIAM J. Optim."},{"key":"297_CR22","unstructured":"Boyd, S., Xiao, L., Mutapcic, A: Subgradient methods, notes for EE392o, stanford university, http:\/\/www.stanford.edu\/class\/ee392o\/subgrad_method.pdf (2003)"},{"issue":"1","key":"297_CR23","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"297_CR24","doi-asserted-by":"crossref","unstructured":"Chambolle, A., Caselles, V., Cremers, D., Novaga, M., Pock, M.: An introduction to total variation for image analysis. In: Theoretical foundations and numerical methods for sparse recovery, vol. 9, pp. 263\u2013340. , Radon Series Comp. Appl. Math., De Gruyter (2010)","DOI":"10.1515\/9783110226157.263"},{"issue":"1","key":"297_CR25","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1137\/110860185","volume":"6","author":"RH Chan","year":"2013","unstructured":"Chan, R.H., Tao, M., Yuan, X.: Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers. SIAM J. Imaging Sci. 6(1), 680\u2013697 (2013)","journal-title":"SIAM J. Imaging Sci."},{"key":"297_CR26","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.-C.: Proximal splitting methods in signal processing (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"297_CR27","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2013","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146, 37\u201375 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"297_CR28","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/110826102","volume":"22","author":"O Devolder","year":"2012","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J. Optim. 22(2), 702\u2013727 (2012)","journal-title":"SIAM J. Optim."},{"key":"297_CR29","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0541-z","volume":"138","author":"CC Gonzaga","year":"2013","unstructured":"Gonzaga, C.C., Karas, E.W.: Fine tuning Nesterov\u2019s steepest descent algorithm for differentiable convex programming. Math. Program. 138, 141\u2013166 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"297_CR30","doi-asserted-by":"crossref","first-page":"1939","DOI":"10.1137\/110836602","volume":"23","author":"CC Gonzaga","year":"2013","unstructured":"Gonzaga, C.C., Karas, E.W., Rossetto, D.R.: An optimal algorithm for constrained differentiable convex optimization. SIAM J. Optim. 23(4), 1939\u20131955 (2013)","journal-title":"SIAM J. Optim."},{"key":"297_CR31","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/42.500147","volume":"15","author":"L Kaufman","year":"1996","unstructured":"Kaufman, L., Neumaier, A.: PET regularization by envelope guided conjugate gradients. IEEE Trans. Med. Imaging 15, 385\u2013389 (1996)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"4","key":"297_CR32","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10618600.1997.10474753","volume":"6","author":"L Kaufman","year":"1997","unstructured":"Kaufman, L., Neumaier, A.: Regularization of ill-posed problems by envelope guided conjugate gradients. J. Comput. Graph. Stat. 6(4), 451\u2013463 (1997)","journal-title":"J. Comput. Graph. Stat."},{"issue":"2","key":"297_CR33","first-page":"375","volume":"16","author":"Y Kim","year":"2006","unstructured":"Kim, Y., Kim, J., Kim, Y.: Blockwise sparse regression. Stat. Sin. 16(2), 375\u2013390 (2006)","journal-title":"Stat. Sin."},{"key":"297_CR34","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"297_CR35","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s11075-007-9136-9","volume":"46","author":"P Hansen","year":"2007","unstructured":"Hansen, P.: Regularization tools version 4.0 for matlab 7.3. Numerical Algorithms 46, 189\u2013194 (2007)","journal-title":"Numerical Algorithms"},{"key":"297_CR36","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/00401706.1970.10488634","volume":"12","author":"AE Hoerl","year":"1970","unstructured":"Hoerl, A.E., Kennard, R.W.: Ridge regression: biased estimation for nonorthogonal problems. Technometrics 12, 55\u201367 (1970)","journal-title":"Technometrics"},{"issue":"1-3","key":"297_CR37","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemarchal","year":"1995","unstructured":"Lemarchal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1-3), 111\u2013147 (1995)","journal-title":"Math. Program."},{"issue":"1","key":"297_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and non-smooth convex optimization. Math. Program. 149(1), 1\u201345 (2015)","journal-title":"Math. Program."},{"key":"297_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-008-0261-6","volume":"126","author":"G Lan","year":"2011","unstructured":"Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with O(1\/\u03b5) iteration-complexity for cone programming. Math. Program. 126, 1\u201329 (2011)","journal-title":"Math. Program."},{"key":"297_CR40","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. Optim. 12, 109\u2013138 (2001)","journal-title":"SIAM J. Optim."},{"key":"297_CR41","volume-title":"Problem complexity and method efficiency in optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem complexity and method efficiency in optimization. Wiley, New York (1983)"},{"key":"297_CR42","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, Dordrecht (2004)"},{"key":"297_CR43","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate o(1\/k 2). Doklady AN SSSR (In Russian) 269, 543\u2013547 (1983). English translation: Soviet Math. Dokl., 27 (1983), 372\u2013376","journal-title":"Doklady AN SSSR (In Russian)"},{"issue":"1","key":"297_CR44","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152(1), 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"297_CR45","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, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"297_CR46","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S1052623403422285","volume":"16","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16, 235\u2013249 (2005)","journal-title":"SIAM J. Optim."},{"key":"297_CR47","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140, 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"297_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-015-0911-4","volume":"158","author":"A Neumaier","year":"2016","unstructured":"Neumaier, A.: OSGA: a fast subgradient algorithm with optimal complexity. Math. Program. 158(1), 1\u201321 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"297_CR49","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1137\/S0036144597321909","volume":"40","author":"A Neumaier","year":"1998","unstructured":"Neumaier, A.: Solving ill-conditioned and singular linear systems: a tutorial on regularization. SIAM Rev. 40(3), 636\u2013666 (1998)","journal-title":"SIAM Rev."},{"key":"297_CR50","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511612916","volume-title":"Introduction to numerical analysis","author":"A Neumaier","year":"2001","unstructured":"Neumaier, A.: Introduction to numerical analysis. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"297_CR51","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Foundations and Trends in Optimization 1(3), 123\u2013231 (2013)","journal-title":"Foundations and Trends in Optimization"},{"key":"297_CR52","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. 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc."},{"key":"297_CR53","unstructured":"Tseng, P: On accelerated proximal gradient methods for convex-concave optimization, technical report, mathematics department, university of washington, http:\/\/pages.cs.wisc.edu\/brecht\/cs726docs\/tseng.APG.pdf (2008)"},{"key":"297_CR54","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 regress ion with grouped variables. J. R. Stat. Soc. 68, 49\u201367 (2006)","journal-title":"J. R. Stat. Soc."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-017-0297-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0297-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-017-0297-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T23:28:20Z","timestamp":1719098900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-017-0297-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,14]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s11075-017-0297-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,14]]}}}