{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T16:24:36Z","timestamp":1771863876645,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T00:00:00Z","timestamp":1391299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10898-014-0151-9","type":"journal-article","created":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T06:52:56Z","timestamp":1391237576000},"page":"19-46","source":"Crossref","is-referenced-by-count":54,"title":["Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization"],"prefix":"10.1007","volume":"61","author":[{"given":"Andrei","family":"Patrascu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,2]]},"reference":[{"key":"151_CR1","volume-title":"Optimisation Methodes Numeriques","author":"A Auslender","year":"1976","unstructured":"Auslender, A.: Optimisation Methodes Numeriques. Masson, Paris (1976)"},{"key":"151_CR2","doi-asserted-by":"crossref","unstructured":"Beck, A.: The 2-Coordinate Descent Method for Solving Double-Sided Simplex Constrained Minimization Problems. Technical Report (2012)","DOI":"10.1007\/s10957-013-0491-5"},{"key":"151_CR3","unstructured":"Bertsekas, D.: Nonlinear Programming. Athena Scientific (1999)"},{"key":"151_CR4","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1093\/imanum\/drq024","volume":"22","author":"S Bonettini","year":"2011","unstructured":"Bonettini, S.: Inexact block coordinate descent methods with application to nonnegative matrix factorization. J. Numer. Anal. 22, 1431\u20131452 (2011)","journal-title":"J. Numer. Anal."},{"key":"151_CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., More, J.J.: Projected gradient methods for linearly constrained problems. Math. Program. 39, 93\u2013116 (1987)","journal-title":"Math. Program."},{"key":"151_CR6","first-page":"203","volume":"2","author":"O Chapelle","year":"2008","unstructured":"Chapelle, O., Sindhwani, V., Keerthi, S.: Optimization techniques for semi-supervised support vector machines. J. Mach. Learn. Res. 2, 203\u2013233 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"151_CR7","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1137\/11083808X","volume":"50","author":"L Fainshil","year":"2012","unstructured":"Fainshil, L., Margaliot, M.: A maximum principle for positive bilinear control systems with applications to positive linear switched systems. SIAM J. Control Optim. 50, 2193\u20132215 (2012)","journal-title":"SIAM J. Control Optim."},{"key":"151_CR8","first-page":"391","volume":"47","author":"J Judice","year":"2008","unstructured":"Judice, J., Raydan, M., Rosa, S.S., Santos, S.A.: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm. Comput. Optim. Appl. 47, 391\u2013407 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"151_CR9","doi-asserted-by":"crossref","unstructured":"Kocvara, M., Outrata, J.: Effective reformulations of the truss topology design problem. Optim. Eng. (2006)","DOI":"10.1007\/s11081-006-6839-z"},{"issue":"1","key":"151_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10957-008-9489-9","volume":"141","author":"CJ Lin","year":"2009","unstructured":"Lin, C.J., Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: Decomposition algorithm model for singly linearly-constrained problems subject to lower and upper bounds. J. Optim. Theory Appl. 141(1), 107\u2013126 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"151_CR11","unstructured":"Lu, Z., Xiao, L.: Randomized Block Coordinate Non-monotone Gradient Method for a Class of Nonlinear Programming. Technical Report (2013)"},{"key":"151_CR12","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/B:COAP.0000044182.33308.82","volume":"29","author":"M Mongeau","year":"2004","unstructured":"Mongeau, M., Torki, M.: Computing eigenelements of real symmetric matrices via optimization. Comput. Optim. Appl. 29, 263\u2013287 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"151_CR13","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: A Random Coordinate Descent Method for Large Optimization Problems with Linear Constraints. Technical Report (2011). http:\/\/acse.pub.ro\/person\/ion-necoara\/"},{"key":"151_CR14","doi-asserted-by":"crossref","unstructured":"Necoara, I., Patrascu, A.: A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints. Comput. Optim. Appl. (2013)","DOI":"10.1007\/s10589-013-9598-8"},{"issue":"8","key":"151_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TAC.2013.2250071","volume":"58","author":"I Necoara","year":"2013","unstructured":"Necoara, I.: Random coordinate descent algorithms for multi-agent convex optimization over networks. IEEE Trans. Autom. Control 58(8), 1\u201312 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"151_CR16","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.jprocont.2012.12.012","volume":"23","author":"I Necoara","year":"2013","unstructured":"Necoara, I., Clipici, D.: Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC. J. Process Control 23(3), 243\u2013253 (2013)","journal-title":"J. Process Control"},{"key":"151_CR17","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, Dordrecht (2004)"},{"issue":"2","key":"151_CR18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"151_CR19","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(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"151_CR20","doi-asserted-by":"crossref","unstructured":"Parlett, B.N.: The Symmetric Eigenvalue Problem. SIAM (1997)","DOI":"10.1137\/1.9781611971163"},{"key":"151_CR21","unstructured":"Poliak, B.T.: Introduction to Optimization. Optimization Software (1987)"},{"key":"151_CR22","doi-asserted-by":"crossref","unstructured":"Powell, M.J.D.: On search directions for minimization algorithms. Mathematical Programming (1973)","DOI":"10.1007\/BF01584660"},{"key":"151_CR23","doi-asserted-by":"crossref","unstructured":"Richtarik, P., Takac, M.: Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design. Operations Research Proceedings, Springer, pp. 27\u201332 (2012)","DOI":"10.1007\/978-3-642-29210-1_5"},{"key":"151_CR24","doi-asserted-by":"crossref","unstructured":"Richtarik, P., Takac, M.: Iteration complexity of randomized block coordinate descent methods for minimizing a composite function. Mathematical Programming (2012)","DOI":"10.1007\/s10107-012-0614-z"},{"key":"151_CR25","unstructured":"Richtarik, P., Takac, M.: Parallel Coordinate Descent Methods for Big Data Optimization, Technical Report, (2012). http:\/\/www.maths.ed.ac.uk\/~richtarik\/"},{"key":"151_CR26","unstructured":"Rockafeller, R.T.: The elementary vectors of a subspace in $${\\mathbb{R}}^N$$ R N . In: Bose, R.C., Downling, T.A. (eds.) Combinatorial Mathematics and its Applications, Proceedings of the Chapel Hill Conference, pp. 104\u2013127 (1969)"},{"key":"151_CR27","volume-title":"Network Flows and Monotropic Optimization","author":"RT Rockafeller","year":"1984","unstructured":"Rockafeller, R.T.: Network Flows and Monotropic Optimization. Wiley-Interscience, New York (1984)"},{"key":"151_CR28","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"151_CR29","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1007\/s10589-010-9388-5","volume":"51","author":"HAL Thi","year":"2012","unstructured":"Thi, H.A.L., Moeini, M., Dihn, T.P., Judice, J.: A DC programming approach for solving the symmetric eigenvalue complementarity problem. Comput. Optim. Appl. 51, 1097\u20131117 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"151_CR30","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 for nonsmooth separable minimization. Math. Program. 117, 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"151_CR31","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."},{"issue":"2","key":"151_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"151_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"VN Vapnik","year":"1995","unstructured":"Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, Berlin (1995)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0151-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0151-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0151-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T06:34:25Z","timestamp":1565159665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0151-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,2]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0151-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,2]]}}}