{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:18Z","timestamp":1740122658923,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,7,22]],"date-time":"2017-07-22T00:00:00Z","timestamp":1500681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,7,22]],"date-time":"2017-07-22T00:00:00Z","timestamp":1500681600000},"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":["CCF1527809"],"award-info":[{"award-number":["CCF1527809"]}],"id":[{"id":"10.13039\/100000001","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":[[2017,12]]},"DOI":"10.1007\/s10589-017-9925-6","type":"journal-article","created":{"date-parts":[[2017,7,22]],"date-time":"2017-07-22T08:52:32Z","timestamp":1500713552000},"page":"479-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Using negative curvature in solving nonlinear programs"],"prefix":"10.1007","volume":"68","author":[{"given":"Donald","family":"Goldfarb","sequence":"first","affiliation":[]},{"given":"Cun","family":"Mu","sequence":"additional","affiliation":[]},{"given":"John","family":"Wright","sequence":"additional","affiliation":[]},{"given":"Chaoxu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: Complete dictionary recovery over the sphere. In: 2015 International Conference on Sampling Theory and Applications (SampTA), pp. 407\u2013410. IEEE (2015)","key":"9925_CR1","DOI":"10.1109\/SAMPTA.2015.7148922"},{"unstructured":"Ge, R., Huang, F., Jin, C., Yuan, Y.: Escaping from saddle points\u2014online stochastic gradient for tensor decomposition. In: Proceedings of The 28th Conference on Learning Theory, pp. 797\u2013842 (2015)","key":"9925_CR2"},{"doi-asserted-by":"crossref","unstructured":"Sun, J., Qu, Q., Wright, J.: A geometric analysis of phase retrieval. arXiv:1602.06664 (2016)","key":"9925_CR3","DOI":"10.1109\/ISIT.2016.7541725"},{"issue":"2","key":"9925_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"9925_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01584328","volume":"13","author":"GP McCormick","year":"1977","unstructured":"McCormick, G.P.: A modification of Armijo\u2019s step-size rule for negative curvature. Math. Program. 13(1), 111\u2013115 (1977)","journal-title":"Math. Program."},{"issue":"1","key":"9925_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582091","volume":"16","author":"JJ Mor\u00e9","year":"1979","unstructured":"Mor\u00e9, J.J., Sorensen, D.C.: On the use of directions of negative curvature in a modified Newton method. Math. Program. 16(1), 1\u201320 (1979)","journal-title":"Math. Program."},{"issue":"1","key":"9925_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01588294","volume":"18","author":"D Goldfarb","year":"1980","unstructured":"Goldfarb, D.: Curvilinear path steplength algorithms for minimization which use directions of negative curvature. Math. Program. 18(1), 31\u201340 (1980)","journal-title":"Math. Program."},{"doi-asserted-by":"crossref","unstructured":"Grandinetti, L.: Nonlinear optimization by a curvilinear path strategy. In: System Modelling and Optimization, pp. 289\u2013298. Springer, Berlin Heidelberg (1984)","key":"9925_CR8","DOI":"10.1007\/BFb0008902"},{"issue":"1","key":"9925_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02247967","volume":"44","author":"JM Mart\u00ednez","year":"1990","unstructured":"Mart\u00ednez, J.M., Santos, R.F.: An algorithm for solving nonlinear least-squares problems with a new curvilinear search. Computing 44(1), 83\u201390 (1990)","journal-title":"Computing"},{"issue":"2","key":"9925_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF00249642","volume":"6","author":"MC Ferris","year":"1996","unstructured":"Ferris, M.C., Lucid, S., Roma, M.: Nonmonotone curvilinear line search methods for unconstrained optimization. Comput. Optim. Appl. 6(2), 117\u2013136 (1996)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9925_CR11","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1137\/S1052623495295250","volume":"8","author":"S Lucidi","year":"1998","unstructured":"Lucidi, S., Rochetich, F., Roma, M.: Curvilinear stabilization techniques for truncated Newton methods in large scale unconstrained optimization. SIAM J. Optim. 8(4), 916\u2013939 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"9925_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/10556780008805794","volume":"14","author":"N Gould","year":"2000","unstructured":"Gould, N., Lucidi, S., Roma, M., Toint, P.L.: Exploiting negative curvature directions in linesearch methods for unconstrained optimization. Optim. Methods Softw. 14(1\u20132), 75\u201398 (2000)","journal-title":"Optim. Methods Softw."},{"issue":"3\u20134","key":"9925_CR13","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1080\/10556780108805822","volume":"15","author":"D Conforti","year":"2001","unstructured":"Conforti, D., Mancini, M.: A curvilinear search algorithm for unconstrained optimization by automatic differentiation. Optim. Methods Softw. 15(3\u20134), 283\u2013297 (2001)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9925_CR14","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.amc.2010.06.032","volume":"217","author":"MS Apostolopoulou","year":"2010","unstructured":"Apostolopoulou, M.S., Sotiropoulos, D.G., Botsaris, C.A.: A curvilinear method based on minimal-memory BFGS updates. Appl. Math. Comput. 217(2), 882\u2013892 (2010)","journal-title":"Appl. Math. Comput."},{"key":"9925_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-29403-2","volume-title":"Riemannian Geometry","author":"P Petersen","year":"2006","unstructured":"Petersen, P.: Riemannian Geometry, vol. 171. Springer, New York (2006)"},{"key":"9925_CR16","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P Absil","year":"2009","unstructured":"Absil, P., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2009)"},{"doi-asserted-by":"crossref","unstructured":"Absil, P.A., Mahony, R., Trumpf, J.: An extrinsic look at the Riemannian Hessian. In: Geometric Science of Information, pp. 361\u2013368. Springer, Berlin Heidelberg (2013)","key":"9925_CR17","DOI":"10.1007\/978-3-642-40020-9_39"},{"unstructured":"Absil, P.A., Trumpf, J., Mahony, R., Andrews, B.: All roads lead to Newton: feasible second-order methods for equality-constrained optimization. Technical report, Technical Report UCL-INMA-2009.024, UCLouvain (2009)","key":"9925_CR18"},{"key":"9925_CR19","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"4","key":"9925_CR20","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1137\/15M1010890","volume":"36","author":"C Mu","year":"2015","unstructured":"Mu, C., Hsu, D., Goldfarb, D.: Successive rank-one approximations for nearly orthogonally decomposable symmetric tensors. SIAM J. Matrix Anal. Appl. 36(4), 1638\u20131659 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"unstructured":"Wang, M., Song, Y.: Tensor decompositions via two-mode higher-order SVD (HOSVD). In: Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, pp. 614\u2013622 (2017)","key":"9925_CR21"},{"doi-asserted-by":"crossref","unstructured":"Mu, C., Hsu, D., Goldfarb, D.: Greedy approaches to symmetric orthogonal tensor decomposition. arXiv:1706.01169 (2017)","key":"9925_CR22","DOI":"10.1137\/16M1087734"},{"key":"9925_CR23","volume-title":"Tensor Methods in Statistics","author":"P McCullagh","year":"1987","unstructured":"McCullagh, P.: Tensor Methods in Statistics, vol. 161. Chapman and Hall, London (1987)"},{"issue":"3","key":"9925_CR24","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0165-1684(94)90029-9","volume":"36","author":"P Comon","year":"1994","unstructured":"Comon, P.: Independent component analysis, a new concept? Signal Process. 36(3), 287\u2013314 (1994)","journal-title":"Signal Process."},{"key":"9925_CR25","volume-title":"Handbook of Blind Source Separation: Independent Component Analysis and Applications","author":"P Comon","year":"2010","unstructured":"Comon, P., Jutten, C.: Handbook of Blind Source Separation: Independent Component Analysis and Applications. Academic Press, Cambridge (2010)"},{"issue":"1","key":"9925_CR26","first-page":"2773","volume":"15","author":"A Anandkumar","year":"2014","unstructured":"Anandkumar, A., Ge, R., Hsu, D., Kakade, S.M., Telgarsky, M.: Tensor decompositions for learning latent variable models. J. Mach. Learn. Res. 15(1), 2773\u20132832 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9925_CR27","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.D.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program. 95(2), 329\u2013357 (2003)","journal-title":"Math. Program."},{"issue":"3","key":"9925_CR28","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., Monteiro, R.D.: Local minima and convergence in low-rank semidefinite programming. Math. Program. 103(3), 427\u2013444 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"9925_CR29","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339\u2013358 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9925_CR30","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02574037","volume":"13","author":"AI Barvinok","year":"1995","unstructured":"Barvinok, A.I.: Problems of distance geometry and convex properties of quadratic maps. Discrete Comput. Geom. 13(2), 189\u2013202 (1995)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Boumal, N., Voroninski, V., Bandeira, A.S.: The non-convex Burer-Monteiro approach works on smooth semidefinite programs. arXiv:1606.04970 (2016)","key":"9925_CR31"},{"issue":"6","key":"9925_CR32","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"unstructured":"Ge, R., Lee, J.D., Ma, T.: Matrix completion has no spurious local minimum. arXiv:1605.07272 (2016)","key":"9925_CR33"},{"doi-asserted-by":"crossref","unstructured":"Boumal, N.: Nonconvex phase synchronization. arXiv:1601.06114 (2016)","key":"9925_CR34","DOI":"10.1137\/16M105808X"},{"unstructured":"Bandeira, A.S., Boumal, N., Voroninski, V.: On the low-rank approach for semidefinite programs arising in synchronization and community detection. In: 29th Annual Conference on Learning Theory, pp. 361\u2013382 (2016)","key":"9925_CR35"},{"unstructured":"Larsen, R.M.: Propack-software for large and sparse SVD calculations. Available online. http:\/\/sun.stanford.edu\/rmunk\/PROPACK , pp. 2008\u20132009 (2004)","key":"9925_CR36"},{"issue":"2","key":"9925_CR37","first-page":"21","volume":"37","author":"A Stathopoulos","year":"2010","unstructured":"Stathopoulos, A., McCombs, J.R.: Primme: preconditioned iterative multimethod eigensolver\u2014methods and software description. ACM Trans. Math. Softw. TOMS 37(2), 21 (2010)","journal-title":"ACM Trans. Math. Softw. TOMS"},{"issue":"1\u20132","key":"9925_CR38","doi-asserted-by":"publisher","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9925-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9925-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9925-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T09:56:27Z","timestamp":1659261387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9925-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,22]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["9925"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9925-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2017,7,22]]},"assertion":[{"value":"27 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}