{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:45Z","timestamp":1740122685481,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T00:00:00Z","timestamp":1582329600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1619884"],"award-info":[{"award-number":["1619884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-20-1-2088"],"award-info":[{"award-number":["N00014-20-1-2088"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10589-020-00174-2","type":"journal-article","created":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T10:02:46Z","timestamp":1582365766000},"page":"69-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Composite convex optimization with global and local inexact oracles"],"prefix":"10.1007","volume":"76","author":[{"given":"Tianxiao","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1077-2579","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,22]]},"reference":[{"issue":"1","key":"174_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"174_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"key":"174_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 3. SIAM, University City (2001)"},{"key":"174_CR4","unstructured":"Bogolubsky, L., Dvurechenskii, P., Gasnikov, A., Gusev, G., Nesterov, Y., Raigorodskii, A., Tikhonov, A., Zhukovskii, M.: Learning supervised pagerank with gradient-based and gradient-free optimization methods. In: Advances in Neural Information Processing Systems, pp. 4914\u20134922 (2016)"},{"issue":"1","key":"174_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"174_CR6","doi-asserted-by":"publisher","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":"174_CR7","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. SIAM, University City (2008)"},{"issue":"3","key":"174_CR8","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19(3), 1171\u20131183 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"174_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1\u20132), 37\u201375 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"174_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10957-016-0999-6","volume":"171","author":"P Dvurechensky","year":"2016","unstructured":"Dvurechensky, P., Gasnikov, A.: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle. J. Optim. Theory Appl. 171(1), 121\u2013145 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"174_CR11","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1093\/biostatistics\/kxm045","volume":"9","author":"J Friedman","year":"2008","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics 9(3), 432\u2013441 (2008)","journal-title":"Biostatistics"},{"issue":"1","key":"174_CR12","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/10556788.2018.1510927","volume":"34","author":"W Gao","year":"2019","unstructured":"Gao, W., Goldfarb, D.: Quasi-Newton methods: superlinear convergence without linesearch for self-concordant functions. Optim. Method Softw. 34(1), 194\u2013217 (2019)","journal-title":"Optim. Method Softw."},{"issue":"3","key":"174_CR13","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/TIP.2011.2168410","volume":"21","author":"ZT Harmany","year":"2012","unstructured":"Harmany, Z.T., Marcia, R.F., Willett, R.M.: This is SPIRAL-TAP: sparse poisson intensity reconstruction algorithms\u2014theory and practice. IEEE Trans. Image Process. 21(3), 1084\u20131096 (2012)","journal-title":"IEEE Trans. Image Process."},{"key":"174_CR14","first-page":"1","volume":"24","author":"CJ Hsieh","year":"2011","unstructured":"Hsieh, C.J., Sustik, M.A., Dhillon, I.S., Ravikumar, P.: Sparse inverse covariance matrix estimation using quadratic approximation. Adv. Neutral Inf. Process. Syst. 24, 1\u201318 (2011)","journal-title":"Adv. Neutral Inf. Process. Syst."},{"issue":"11","key":"174_CR15","doi-asserted-by":"publisher","first-page":"4314","DOI":"10.1109\/TIP.2013.2271852","volume":"22","author":"S Lefkimmiatis","year":"2013","unstructured":"Lefkimmiatis, S., Unser, M.: Poisson image reconstruction with hessian schatten-norm regularization. IEEE Trans. Image Process. 22(11), 4314\u20134327 (2013)","journal-title":"IEEE Trans. Image Process."},{"issue":"1","key":"174_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00186-016-0566-9","volume":"85","author":"J Li","year":"2017","unstructured":"Li, J., Andersen, M., Vandenberghe, L.: Inexact proximal newton methods for self-concordant functions. Math. Methods Oper. Res. 85(1), 19\u201341 (2017)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"174_CR17","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s12532-010-0020-6","volume":"2","author":"L Li","year":"2010","unstructured":"Li, L., Toh, K.C.: An inexact interior-point method for $$\\ell _1$$-regularized sparse covariance selection. Math. Program. Compt. 2(3), 291\u2013315 (2010)","journal-title":"Math. Program. Compt."},{"issue":"3","key":"174_CR18","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1137\/16M1082767","volume":"27","author":"Z Lu","year":"2017","unstructured":"Lu, Z.: Randomized block proximal damped Newton method for composite self-concordant minimization. SIAM J. Optim. 27(3), 1910\u20131942 (2017)","journal-title":"SIAM J. Optim."},{"issue":"480","key":"174_CR19","doi-asserted-by":"publisher","first-page":"1267","DOI":"10.1198\/016214507000001120","volume":"102","author":"SJ Marron","year":"2007","unstructured":"Marron, S.J., Todd, M.J., Ahn, J.: Distance-weighted discrimination. J. Am. Stat. Assoc. 102(480), 1267\u20131271 (2007)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"174_CR20","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1080\/10556788.2017.1380642","volume":"34","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Patrascu, A., Glineur, F.: Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. Optim. Method Softw. 34(2), 305\u2013335 (2019)","journal-title":"Optim. Method Softw."},{"issue":"3","key":"174_CR21","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","volume":"143","author":"I Necoara","year":"2009","unstructured":"Necoara, I., Suykens, J.A.K.: Interior-point Lagrangian decomposition method for separable convex optimization. J. Optim. Theory Appl. 143(3), 567\u2013588 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"174_CR22","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovskii","year":"1983","unstructured":"Nemirovskii, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley, New York (1983)"},{"key":"174_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization : A Basic Course, Volume 87 of Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization : A Basic Course, Volume 87 of Applied Optimization. Kluwer Academic Publishers, Berlin (2004)"},{"key":"174_CR24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial Mathematics, New York (1994)"},{"key":"174_CR25","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"174_CR26","first-page":"1","volume":"25","author":"PA Olsen","year":"2012","unstructured":"Olsen, P.A., Oztoprak, F., Nocedal, J., Rennie, S.J.: Newton-like methods for sparse inverse covariance estimation. Adv. Neural Inf. Process. Syst. 25, 1\u20139 (2012)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"174_CR27","unstructured":"Ostrovskii, D.M., Bach, F.: Finite-sample analysis of M-estimators using self-concordance. arXiv:1810.06838v1 (2018)"},{"issue":"3","key":"174_CR28","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"174_CR29","series-title":"Princeton Mathematics Series","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematics Series, vol. 28. Princeton University Press, Princeton (1970)"},{"key":"174_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modelling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on Stochastic Programming: Modelling and Theory. SIAM, University City (2009)"},{"key":"174_CR31","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-018-1282-4","volume":"178","author":"T Sun","year":"2018","unstructured":"Sun, T., Tran-Dinh, Q.: Generalized self-concordant functions: a recipe for Newton-type methods. Math. Program. 178, 145\u2013213 (2018)","journal-title":"Math. Program."},{"key":"174_CR32","doi-asserted-by":"crossref","unstructured":"Toh, K.-C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: On the implementation and usage of SDPT3\u2014a Matlab software package for semidefinite-quadratic-linear programming. Technical Report\u00a04, NUS Singapore (2010)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"key":"174_CR33","first-page":"374","volume":"15","author":"Q Tran-Dinh","year":"2015","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: Composite self-concordant minimization. J. Mach. Learn. Res. 15, 374\u2013416 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"174_CR34","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/11085311X","volume":"23","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., Necoara, I., Savorgnan, C., Diehl, M.: An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization. SIAM J. Optim. 23(1), 95\u2013125 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"174_CR35","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10107-018-1264-6","volume":"177","author":"Q Tran-Dinh","year":"2019","unstructured":"Tran-Dinh, Q., Sun, T., Lu, S.: Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms. Math. Program. 177(1\u20132), 173\u2013223 (2019)","journal-title":"Math. Program."},{"key":"174_CR36","doi-asserted-by":"publisher","first-page":"12658","DOI":"10.1109\/ACCESS.2018.2890583","volume":"7","author":"RY Zhang","year":"2019","unstructured":"Zhang, R.Y., Fattahi, S., Sojoudi, S.: Linear-time algorithm for learning large-scale sparse graphical models. IEEE Access 7, 12658\u201312672 (2019)","journal-title":"IEEE Access"},{"key":"174_CR37","unstructured":"Zhang, Y., Lin, X.: DiSCO: distributed optimization for self-concordant empirical loss. In: Proceedings of the 32th International Conference on Machine Learning, pp. 362\u2013370 (2015)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00174-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00174-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T00:31:20Z","timestamp":1613867480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00174-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,22]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00174-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,2,22]]},"assertion":[{"value":"20 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}