{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T15:00:02Z","timestamp":1776870002823,"version":"3.51.2"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["421386\/2016-9"],"award-info":[{"award-number":["421386\/2016-9"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["308523\/2017-2"],"award-info":[{"award-number":["308523\/2017-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88881.310538\/2018-01"],"award-info":[{"award-number":["88881.310538\/2018-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11075-020-00948-z","type":"journal-article","created":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:02:56Z","timestamp":1591873376000},"page":"1651-1684","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Nonmonotone inexact restoration approach for minimization with orthogonality constraints"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8673-1319","authenticated-orcid":false,"given":"Juliano B.","family":"Francisco","sequence":"first","affiliation":[]},{"given":"Douglas S.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Ferm\u00edn S. V.","family":"Baz\u00e1n","sequence":"additional","affiliation":[]},{"given":"Lila L. T.","family":"Paredes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"issue":"3","key":"948_CR1","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1109\/TSP.2007.908999","volume":"56","author":"T Abrudan","year":"2008","unstructured":"Abrudan, T., Eriksson, J., Koivunen, V.: Steepest descent algorithms for optimization under unitary matrix constraint. IEEE Trans. Signal Process. 56(3), 1134\u20131147 (2008)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"948_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-005-0179-9","volume":"7","author":"P-A 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":"948_CR3","doi-asserted-by":"crossref","unstructured":"Absil, P.A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, Princeton (2008)","DOI":"10.1515\/9781400830244"},{"issue":"1","key":"948_CR4","doi-asserted-by":"publisher","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":"15","key":"948_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.cam.2015.04.047","volume":"290","author":"B Aroux\u00e9t","year":"2015","unstructured":"Aroux\u00e9t, B., Echebest, N.E., Pilotta, E.A.: Inexact Restoration method for nonlinear optimization without derivatives. J. Comput. Appl. Math. 290(15), 26\u201343 (2015)","journal-title":"J. Comput. Appl. Math."},{"key":"948_CR6","doi-asserted-by":"publisher","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 methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"948_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2014.12.031","volume":"282","author":"EG Birgin","year":"2015","unstructured":"Birgin, E.G., Bueno, L.F., Mart\u00ednez, J.M.: Assessing the reability of general-purpose inexact restoration methods. J. Comput. Appl. Math. 282, 1\u201316 (2015)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"948_CR8","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, Marcos: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10(4), 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"948_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10957-005-6537-6","volume":"127","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Local convergence of an inexact-restoration method and numerical experiments. J. Optim. Theory Appl. 127(2), 229\u2013247 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"948_CR10","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1137\/18M1216146","volume":"30","author":"LF Bueno","year":"2020","unstructured":"Bueno, L.F., Mart\u00ednez, J.M.: On the complexity of an inexact restoration method for constrained optimization. SIAM J. Optim. 30(1), 80\u2013101 (2020)","journal-title":"SIAM J. Optim."},{"key":"948_CR11","first-page":"1455","volume":"15","author":"N Boumal","year":"2014","unstructured":"Boumal, N., Mishra, B., Absil, P.-A., Sepulchre, R.: MAnopt, a Matlab Toolbox for optimization on manifolds. J. Mach. Learn. Res. 15, 1455\u20131459 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"948_CR12","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/110856253","volume":"23","author":"LF Bueno","year":"2013","unstructured":"Bueno, L.F., Friedlander, A., Mart\u00ednez, J.M., Sobral, F.N.C.: Inexact restoration method for derivative-free optimization with smooth constraints. SIAM J. Optim. 23(2), 1189\u20131213 (2013)","journal-title":"SIAM J. Optim."},{"key":"948_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s10957-014-0572-0","volume":"165","author":"LF Bueno","year":"2015","unstructured":"Bueno, L.F., Haeser, G., Mart\u00ednez, J.M.: A flexible inexact-restoration method for constrained optimization. J. Optim. Theory Appl. 165, 188\u2013208 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"948_CR14","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s10915-010-9358-1","volume":"45","author":"E Canc\u00e8s","year":"2010","unstructured":"Canc\u00e8s, E., Chakir, R., Maday, Y.: Numerical analysis of nonlinear eigenvalue problems. J. Sci. Comput. 45, 90\u2013117 (2010)","journal-title":"J. Sci. Comput."},{"key":"948_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"2","key":"948_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303\u2013353 (1998)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"948_CR17","doi-asserted-by":"publisher","unstructured":"Francisco, J.B., Gon\u00e7alves, D.S., Baz\u00e1n, F.S.V., Paredes, L.L.T.: Nonmonotone Inexact Restoration Method for nonlinear programming, Computational Optimization and Applications to appear. https:\/\/doi.org\/10.1007\/s10589-019-00129-2(2019)","DOI":"10.1007\/s10589-019-00129-2"},{"issue":"10","key":"948_CR18","doi-asserted-by":"publisher","first-page":"2717","DOI":"10.1016\/j.cam.2012.01.014","volume":"236","author":"JB Francisco","year":"2012","unstructured":"Francisco, J.B., Viloche Baz\u00e1n, F.S.: Nonmonotone algorithm for minimization on closed sets with application to minimization on Stiefel manifolds. J. Comp. and Appl. Math. 236(10), 2717\u20132727 (2012)","journal-title":"J. Comp. and Appl. Math."},{"key":"948_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.apnum.2016.09.018","volume":"112","author":"JB Francisco","year":"2017","unstructured":"Francisco, J.B., Baz\u00e1n, F.S.V., Weber Mendon\u00e7a, M.: Non-monotone algorithm for minimization on arbitrary domains with applications to large-scale orthogonal Procrustes problem, Appl. Num. Math. 112, 51\u201364 (2017)","journal-title":"Num. Math."},{"key":"948_CR20","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-010-9318-6","volume":"50","author":"JB Francisco","year":"2011","unstructured":"Francisco, J.B., Mart\u00ednez, J.M., Mart\u00ednez, L., Pisnitchenko, F.: Inexact restoration method for minimization problems arising in electronic structure calculations. Comput. Optim. Appl. 50, 555\u2013590 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"948_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10589-009-9267-0","volume":"46","author":"A Fischer","year":"2010","unstructured":"Fischer, A., Friedlander, A.: A new line search inexact restoration approach for nonlinear programming. Comput. Optim. Appl. 46, 333\u2013346 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"948_CR22","doi-asserted-by":"crossref","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 4th ed. The Johns Hopkins University Press (2013)","DOI":"10.56021\/9781421407944"},{"key":"948_CR23","doi-asserted-by":"crossref","unstructured":"Helgaker, T., J\u00f8Rgensen, J., Olsen, J.: Electronic - Structure theory. Wiley, New York (2000)","DOI":"10.1002\/9781119019572"},{"key":"948_CR24","doi-asserted-by":"crossref","unstructured":"Janin, R.: Directional derivative of the marginal function in non linear programming. In: Sensitivity, Stability and Parametric Analysis, Math. Program. Stud., pp. 110\u2013126. Springer, Berlin (1984)","DOI":"10.1007\/BFb0121214"},{"issue":"2","key":"948_CR25","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10107-014-0816-7","volume":"153","author":"B Jiang","year":"2015","unstructured":"Jiang, B., Dai, Y.H.: A framework of constraint preserving update schemes for optimization on Stiefel manifold. Math. Program., Ser. A 153(2), 535\u2013575 (2015)","journal-title":"Math. Program., Ser. A"},{"key":"948_CR26","first-page":"517","volume":"11","author":"M Journ\u00e9e","year":"2010","unstructured":"Journ\u00e9e, M., Nesterov, Y., Richt\u00e1rik, P., Sepulchre, R.: Generalized power method for sparse principal component analysis. J. Mach. Learn. Res. 11, 517\u2013553 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"948_CR27","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/78.984753","volume":"50","author":"JH Manton","year":"2002","unstructured":"Manton, J.H.: Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50(3), 635\u2013650 (2002)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"948_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1023\/A:1004632923654","volume":"104","author":"JM Mart\u00ednez","year":"2000","unstructured":"Mart\u00ednez, J.M., Pilotta, E.A.: Inexact restoration algorithm for constrained optimization. J. Optim. Theory App. 104(1), 135\u2013163 (2000)","journal-title":"J. Optim. Theory App."},{"issue":"1","key":"948_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1024791525441","volume":"118","author":"JM Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez, J.M., Svaiter, B.F.: A practical optimality condition without constraint qualifications for nonlinear programming. J. Optimiz. Theory App. 118 (1), 117\u2013133 (2003)","journal-title":"J. Optimiz. Theory App."},{"key":"948_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.neucom.2004.11.035","volume":"67","author":"Y Nishimori","year":"2005","unstructured":"Nishimori, Y., Akaho, S.: Learning algorithms utilizing quasi-geodesic flows on the Stiefel manifold. Neurocomputing 67, 106\u2013135 (2005)","journal-title":"Neurocomputing"},{"issue":"11","key":"948_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0898-1221(95)00161-Q","volume":"30","author":"M Shariff","year":"1995","unstructured":"Shariff, M.: A constrained conjugate gradient method and the solution of linear equations. Comp. Mathem. Appl. 30(11), 25\u201337 (1995)","journal-title":"Comp. Mathem. Appl."},{"key":"948_CR32","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10589-007-9162-5","volume":"44","author":"EW Karas","year":"2009","unstructured":"Karas, E. W., Pilotta, E., Ribeiro, A.: Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems. Comput. Optim. Appl. 44, 427\u2013441 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"948_CR33","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1137\/090766668","volume":"48","author":"CY Kaya","year":"2010","unstructured":"Kaya, C.Y.: Inexact restoration for Runge\u2013Kutta discretization of optimal control problems. SIAM J. Numer. Anal. 48(4), 1492\u20131517 (2010)","journal-title":"SIAM J. Numer. Anal."},{"issue":"5","key":"948_CR34","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1103\/RevModPhys.71.1253","volume":"71","author":"W Kohn","year":"1999","unstructured":"Kohn, W.: Nobel lecture: electronic structure of matter\u2013wave functions and density functionals. Rev. Modern Phys. 71(5), 1253\u20131266 (1999)","journal-title":"Rev. Modern Phys."},{"key":"948_CR35","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1090\/mcom\/3025","volume":"85","author":"N Kreji\u0107","year":"2016","unstructured":"Kreji\u0107, N., Mart\u00ednez, J.M.: Inexact restoration approach for minimization with inexact evaluation of the objective function. Mathematics of Computation 85, 1775\u20131791 (2016)","journal-title":"Mathematics of Computation"},{"key":"948_CR36","doi-asserted-by":"crossref","unstructured":"Wen, Z., Yin, W.: A feasible method for optimization with orthogonality constraints. Math. Program. Ser. A, 142, 397\u2013434 (2013)","DOI":"10.1007\/s10107-012-0584-1"},{"issue":"4","key":"948_CR37","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optimiz. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optimiz."},{"issue":"2","key":"948_CR38","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1137\/140967994","volume":"36","author":"Z Zhao","year":"2015","unstructured":"Zhao, Z., Bai, Z.-J., Jin, X.-Q.: A Riemannian Newton algorithm for nonlinear eigenvalue problems. SIAM J. Matrix Anal. Appl. 36(2), 752\u2013774 (2015)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"948_CR39","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s11075-014-9924-y","volume":"69","author":"X Zhu","year":"2015","unstructured":"Zhu, X.: A feasible filter method for the nearest low-rank correlation matrix problem. Numer. Algorithm. 69, 763\u2013784 (2015)","journal-title":"Numer. Algorithm."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00948-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00948-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00948-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T07:38:22Z","timestamp":1696232302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00948-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00948-z","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"3 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}