{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:48:25Z","timestamp":1787388505013,"version":"build-2736575974"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"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":["1462408"],"award-info":[{"award-number":["1462408"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10107-019-01418-8","type":"journal-article","created":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T07:02:18Z","timestamp":1565420538000},"page":"445-490","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis"],"prefix":"10.1007","volume":"184","author":[{"given":"Junyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5838-1676","authenticated-orcid":false,"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,10]]},"reference":[{"key":"1418_CR1","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Convergence analysis of Riemannian trust-region methods. Technical report (2006)"},{"issue":"3","key":"1418_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on Riemannian manifolds. Found. Comput. Math. 7(3), 303\u2013330 (2007)","journal-title":"Found. Comput. Math."},{"key":"1418_CR3","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"PA Absil","year":"2009","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"1418_CR4","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/100802529","volume":"22","author":"PA Absil","year":"2012","unstructured":"Absil, P.A., Malick, J.: Projection-like retractions on matrix manifolds. SIAM J. Optim. 22(1), 135\u2013158 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1418_CR5","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/j.laa.2011.08.010","volume":"438","author":"J Ballani","year":"2013","unstructured":"Ballani, J., Grasedyck, L., Kluge, M.: Black box approximation of tensors in hierarchical Tucker format. Linear Algebra Appl. 438(2), 639\u2013657 (2013)","journal-title":"Linear Algebra Appl."},{"key":"1418_CR6","unstructured":"Bento, G.C., Ferreira, O.P., Melo, J.G.: Iteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifolds. https:\/\/arxiv.org\/pdf\/1609.04869.pdf (2016)"},{"issue":"3","key":"1418_CR7","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1137\/15M1052858","volume":"9","author":"R Bergmann","year":"2016","unstructured":"Bergmann, R., Persch, J., Steidl, G.: A parallel Douglas\u2013Rachford algorithm for minimizing ROF-like functionals on images with values in symmetric Hadamard manifolds. SIAM J. Imaging Sci. 9(3), 901\u2013937 (2016)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"1418_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/imanum\/drx080","volume":"39","author":"N Boumal","year":"2018","unstructured":"Boumal, N., Absil, P.A., Cartis, C.: Global rates of convergence for nonconvex optimization on manifolds. IMA J. Numer. Anal. 39(1), 1\u201333 (2018)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"1418_CR9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11 (2011)","journal-title":"J. ACM"},{"issue":"1","key":"1418_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"1418_CR11","unstructured":"Chen, Y., Li, X., Xu, J.: Convexified modularity maximization for degree-corrected stochastic block models. arXiv preprint arXiv:1512.08425 (2015)"},{"key":"1418_CR12","first-page":"847","volume":"5","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Nonsmooth analysis and optimization. Proc. Int. Congr. Math. 5, 847\u2013853 (1983)","journal-title":"Proc. Int. Congr. Math."},{"issue":"4","key":"1418_CR13","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/S0895479896305696","volume":"21","author":"L De Lathauwer","year":"2000","unstructured":"De Lathauwer, L., De Moor, B., Vandewalle, J.: A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21(4), 1253\u20131278 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1418_CR14","unstructured":"Dhillon, I.S., Sra, S.: Generalized nonnegative matrix approximations with Bregman divergences. In: NIPS, vol. 18 (2005)"},{"issue":"4","key":"1418_CR15","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1418_CR16","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"1418_CR17","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1080\/02331930290019413","volume":"51","author":"OP Ferreira","year":"2002","unstructured":"Ferreira, O.P., Oliveira, P.R.: Proximal point algorithm on Riemannian manifolds. Optimization 51(2), 257\u2013270 (2002)","journal-title":"Optimization"},{"issue":"1","key":"1418_CR18","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze, A., Jerrum, M.: Improved approximation algorithms for MAX k-CUT and MAX bisection. Algorithmica 18(1), 67\u201381 (1997)","journal-title":"Algorithmica"},{"issue":"3","key":"1418_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu, W.J.: Penalized regressions: the bridge versus the lasso. J. Comput. Graph. Stat. 7(3), 397\u2013416 (1998)","journal-title":"J. Comput. Graph. Stat."},{"issue":"4","key":"1418_CR20","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1418_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1418_CR22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1\u20132), 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"1418_CR23","unstructured":"Ghosh, S., Lam, H.: Computing worst-case input models in stochastic simulation. arXiv preprint arXiv:1507.05609 (2015)"},{"key":"1418_CR24","unstructured":"Ghosh, S., Lam, H.: Mirror descent stochastic approximation for computing worst-case stochastic input models. In: Winter Simulation Conference, 2015, pp. 425\u2013436. IEEE (2015)"},{"key":"1418_CR25","unstructured":"Grant, M., Boyd, S., Ye, Y.: CVX: MATLAB software for disciplined convex programming (2008)"},{"key":"1418_CR26","unstructured":"Hong, M.: Decomposing linearly constrained nonconvex problems by a proximal primal dual approach: algorithms, convergence, and applications. arXiv preprint arXiv:1604.00543 (2016)"},{"issue":"1","key":"1418_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/140990309","volume":"26","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.-Q., Razaviyayn, M.: Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems. SIAM J. Optim. 26(1), 337\u2013364 (2016)","journal-title":"SIAM J. Optim."},{"issue":"12","key":"1418_CR28","first-page":"3884","volume":"74","author":"S Hosseini","year":"2011","unstructured":"Hosseini, S., Pouryayevali, M.R.: Generalized gradients and characterization of epi-Lipschitz sets in Riemannian manifolds. Fuel Energy Abstr. 74(12), 3884\u20133895 (2011)","journal-title":"Fuel Energy Abstr."},{"key":"1418_CR29","unstructured":"Huper, K., Trumpf, J.: Newton-like methods for numerical optimization on manifolds. In: Signals, Systems and Computers, 2004. Conference Record of the Thirty-Eighth Asilomar Conference, vol. 1, pp. 136\u2013139. IEEE (2004)"},{"key":"1418_CR30","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 665\u2013674. ACM (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"1","key":"1418_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-018-0034-y","volume":"72","author":"B Jiang","year":"2019","unstructured":"Jiang, B., Lin, T., Ma, S., Zhang, S.: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. Comput. Optim. Appl. 72(1), 115\u2013157 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1418_CR32","unstructured":"Jiang, B., Ma, S., So, A.M.-C., Zhang, S.: Vector transport-free SVRG with general retraction for Riemannian optimization: complexity analysis and practical implementation. Preprint arXiv:1705.09059 (2017)"},{"issue":"1","key":"1418_CR33","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1214\/14-AOS1265","volume":"43","author":"J Jin","year":"2015","unstructured":"Jin, J.: Fast community detection by score. Ann. Stat. 43(1), 57\u201389 (2015)","journal-title":"Ann. Stat."},{"key":"1418_CR34","unstructured":"Kasai, H., Sato, H., Mishra, B.: Riemannian stochastic variance reduced gradient on Grassmann manifold. arXiv preprint arXiv:1605.07367 (2016)"},{"issue":"3","key":"1418_CR35","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455\u2013500 (2009)","journal-title":"SIAM Rev."},{"key":"1418_CR36","doi-asserted-by":"crossref","unstructured":"Kovnatsky, A., Glashoff, K., Bronstein, M.: MADMM: a generic algorithm for non-smooth optimization on manifolds. In: European Conference on Computer Vision, pp. 680\u2013696. Springer (2016)","DOI":"10.1007\/978-3-319-46454-1_41"},{"issue":"2","key":"1418_CR37","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10915-013-9740-x","volume":"58","author":"R Lai","year":"2014","unstructured":"Lai, R., Osher, S.: A splitting method for orthogonality constrained problems. J. Sci. Comput. 58(2), 431\u2013449 (2014)","journal-title":"J. Sci. Comput."},{"issue":"10","key":"1418_CR38","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/TNNLS.2013.2297381","volume":"25","author":"Z Lai","year":"2014","unstructured":"Lai, Z., Xu, Y., Chen, Q., Yang, J., Zhang, D.: Multilinear sparse principal component analysis. IEEE Trans. Neural Netw. Learn. Syst. 25(10), 1942\u20131950 (2014)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1418_CR39","first-page":"801","volume":"19","author":"H Lee","year":"2007","unstructured":"Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. Adv. Neural Inf. Process. Syst. 19, 801 (2007)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1418_CR40","volume-title":"Introduction to Smooth Manifolds","author":"JM Lee","year":"2013","unstructured":"Lee, J.M.: Introduction to Smooth Manifolds. Springer, New York (2013)"},{"issue":"4","key":"1418_CR41","doi-asserted-by":"crossref","first-page":"2434","DOI":"10.1137\/140998135","volume":"25","author":"G Li","year":"2015","unstructured":"Li, G., Pong, T.K.: Global convergence of splitting methods for nonconvex composite optimization. SIAM J. Optim. 25(4), 2434\u20132460 (2015)","journal-title":"SIAM J. Optim."},{"key":"1418_CR42","unstructured":"Liu, H., Wu, W., So, A.M.-C.: Quadratic optimization with orthogonality constraints: explicit Lojasiewicz exponent and linear convergence of line-search methods. In: ICML, pp. 1158\u20131167 (2016)"},{"issue":"1","key":"1418_CR43","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TNN.2007.901277","volume":"19","author":"H Lu","year":"2008","unstructured":"Lu, H., Plataniotis, K.N., Venetsanopoulos, A.N.: MPCA: multilinear principal component analysis of tensor objects. IEEE Trans. Neural Netw. 19(1), 18\u201339 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"11","key":"1418_CR44","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1287\/mnsc.18.11.620","volume":"18","author":"DG Luenberger","year":"1972","unstructured":"Luenberger, D.G.: The gradient projection method along geodesics. Manag. Sci. 18(11), 620\u2013631 (1972)","journal-title":"Manag. Sci."},{"issue":"1","key":"1418_CR45","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/0022-247X(82)90180-9","volume":"88","author":"D Motreanu","year":"1982","unstructured":"Motreanu, D., Pavel, N.H.: Quasi-tangent vectors in flow-invariance and optimization problems on Banach manifolds. J. Math. Anal. Appl. 88(1), 116\u2013132 (1982)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"1418_CR46","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-006-0033-0","volume":"109","author":"A Nemirovski","year":"2007","unstructured":"Nemirovski, A.: Sums of random symmetric matrices and quadratic optimization under orthogonality constraints. Math. Program. 109(2), 283\u2013317 (2007)","journal-title":"Math. Program."},{"key":"1418_CR47","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, vol. 9, no. 4, p. 1556. Springer"},{"issue":"5","key":"1418_CR48","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets, I.V.: Tensor-train decomposition. SIAM J. Sci. Comput. 33(5), 2295\u20132317 (2011)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1418_CR49","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"IV Oseledets","year":"2010","unstructured":"Oseledets, I.V., Tyrtyshnikov, E.: TT-cross approximation for multidimensional arrays. Linear Algebra Appl. 432(1), 70\u201388 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"1418_CR50","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1109\/TASL.2009.2036813","volume":"18","author":"Y Panagakis","year":"2010","unstructured":"Panagakis, Y., Kotropoulos, C., Arce, G.R.: Non-negative multilinear principal component analysis of auditory temporal modulations for music genre classification. IEEE Trans. Audio Speech Lang. Process. 18(3), 576\u2013588 (2010)","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"1418_CR51","unstructured":"Reddi, S.J., Sra, S., Poczos, B., Smola, A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: Advances in Neural Information Processing Systems, pp. 1145\u20131153 (2016)"},{"key":"1418_CR52","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0362-546X(79)90044-0","volume":"3","author":"RT Rockafellar","year":"1979","unstructured":"Rockafellar, R.T.: Clarke\u2019s tangent cones and the boundaries of closed sets in $$\\mathbb{R}^n$$. Nonlinear Anal. Theory Methods Appl. 3, 145\u2013154 (1979)","journal-title":"Nonlinear Anal. Theory Methods Appl."},{"issue":"3","key":"1418_CR53","first-page":"113","volume":"3","author":"ST Smith","year":"1994","unstructured":"Smith, S.T.: Optimization techniques on Riemannian manifolds. Fields Inst. Commun. 3(3), 113\u2013135 (1994)","journal-title":"Fields Inst. Commun."},{"key":"1418_CR54","unstructured":"Srebro, N., Jaakkola, T.: Weighted low-rank approximations. In: ICML, vol. 3, pp. 720\u2013727 (2003)"},{"issue":"2","key":"1418_CR55","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/TIT.2016.2632149","volume":"63","author":"J Sun","year":"2017","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere II: recovery by Riemannian trust-region method. IEEE Trans. Inf. Theory 63(2), 885\u2013914 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1418_CR56","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. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"1418_CR57","unstructured":"Wang, F., Cao, W., Xu, Z.: Convergence of multi-block Bregman ADMM for nonconvex composite problems. arXiv preprint arXiv:1505.03063 (2015)"},{"key":"1418_CR58","unstructured":"Wang, S., Sun, M., Chen, Y., Pang, E., Zhou, C.: STPCA: sparse tensor principal component analysis for feature extraction. In: 21st International Conference on Pattern Recognition, 2012, pp. 2278\u20132281. IEEE (2012)"},{"issue":"1","key":"1418_CR59","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","volume":"78","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Yin, W., Zeng, J.: Global convergence of ADMM in nonconvex nonsmooth optimization. J. Sci. Comput. 78(1), 29\u201363 (2019)","journal-title":"J. Sci. Comput."},{"issue":"1\u20132","key":"1418_CR60","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. 142(1\u20132), 397\u2013434 (2013)","journal-title":"Math. Program."},{"key":"1418_CR61","unstructured":"Wiegele, A.: Biq Mac library\u2014a collection of max-cut and quadratic 0\u20131 programming instances of medium size. Preprint (2007)"},{"issue":"1","key":"1418_CR62","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s12532-014-0074-y","volume":"7","author":"Y Xu","year":"2015","unstructured":"Xu, Y.: Alternating proximal gradient method for sparse nonnegative Tucker decomposition. Math. Program. Comput. 7(1), 39\u201370 (2015)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1418_CR63","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/15M1027528","volume":"10","author":"L Yang","year":"2017","unstructured":"Yang, L., Pong, T.K., Chen, X.: Alternating direction method of multipliers for a class of nonconvex and nonsmooth problems with applications to background\/foreground extraction. SIAM J. Imaging Sci. 10(1), 74\u2013110 (2017)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"1418_CR64","first-page":"415","volume":"10","author":"WH Yang","year":"2014","unstructured":"Yang, W.H., Zhang, L.-H., Song, R.: Optimality conditions for the nonlinear programming problems on Riemannian manifolds. Pac. J. Optim. 10(2), 415\u2013434 (2014)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"1418_CR65","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y Ye","year":"2001","unstructured":"Ye, Y.: A. 699-approximation algorithm for max-bisection. Math. Program. 90(1), 101\u2013111 (2001)","journal-title":"Math. Program."},{"key":"1418_CR66","unstructured":"Zhang, H., Reddi, S.J., Sra, S.: Riemannian SVRG: fast stochastic optimization on Riemannian manifolds. In: Advances in Neural Information Processing Systems, pp. 4592\u20134600 (2016)"},{"key":"1418_CR67","unstructured":"Zhang, H., Sra, S.: First-order methods for geodesically convex optimization. arXiv preprint arXiv:1602.06053 (2016)"},{"issue":"5","key":"1418_CR68","doi-asserted-by":"crossref","first-page":"A3091","DOI":"10.1137\/17M1141904","volume":"40","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Liu, H., Wen, Z., Zhang, S.: A sparse completely positive relaxation of the modularity maximization for community detection. SIAM J. Sci. Comput. 40(5), A3091\u2013A3120 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1418_CR69","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1137\/S0895479899352045","volume":"23","author":"T Zhang","year":"2001","unstructured":"Zhang, T., Golub, G.H.: Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl. 23(2), 534\u2013550 (2001)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1418_CR70","unstructured":"Zhang, Y., Levina, E., Zhu, J.: Detecting overlapping communities in networks using spectral methods. arXiv preprint arXiv:1412.3432 (2014)"},{"issue":"1","key":"1418_CR71","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10915-017-0359-1","volume":"72","author":"H Zhu","year":"2017","unstructured":"Zhu, H., Zhang, X., Chu, D., Liao, L.: Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method. J. Sci. Comput. 72(1), 331\u2013372 (2017)","journal-title":"J. Sci. Comput."},{"issue":"2","key":"1418_CR72","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. B 67(2), 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01418-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01418-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01418-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T21:59:10Z","timestamp":1721599150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01418-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,10]]},"references-count":72,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1418"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01418-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,10]]},"assertion":[{"value":"29 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}