{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:55:32Z","timestamp":1769928932828,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,12,8]],"date-time":"2012-12-08T00:00:00Z","timestamp":1354924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10107-012-0617-9","type":"journal-article","created":{"date-parts":[[2012,12,7]],"date-time":"2012-12-07T00:44:12Z","timestamp":1354841052000},"page":"93-106","source":"Crossref","is-referenced-by-count":35,"title":["On the complexity of finding first-order critical points in constrained nonlinear optimization"],"prefix":"10.1007","volume":"144","author":[{"given":"Coralia","family":"Cartis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas I.M.","family":"Gould","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe L.","family":"Toint","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,8]]},"reference":[{"issue":"2","key":"617_CR1","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S1052623403426532","volume":"16","author":"RH Byrd","year":"2005","unstructured":"Byrd, R.H., Gould, N.I.M., Nocedal, J., Waltz, R.A.: On the convergence of successive linear-quadratic programming algorithms. SIAM J. Optim. 16(2), 471\u2013489 (2005)","journal-title":"SIAM J. Optim."},{"key":"617_CR2","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20, 2833\u20132852 (2010)"},{"key":"617_CR3","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Ser. A 127(2), 245\u2013295 (2011)","DOI":"10.1007\/s10107-009-0286-5"},{"key":"617_CR4","doi-asserted-by":"crossref","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. Ser. A 130, 295\u2013319 (2011)","DOI":"10.1007\/s10107-009-0337-y"},{"key":"617_CR5","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming. SIAM J. Optim. 21(4), 1721\u20131739 (2011)"},{"key":"617_CR6","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Optimal Newton-type methods for nonconvex smooth optimization problems. ERGO technical report 11-009, School of Mathematics, University of Edinburgh (2011)"},{"key":"617_CR7","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: A note about the complexity of minimizing Nesterov\u2019s smooth Chebyshev\u2013Rosenbrock function. ERGO technical report 11\u2013013, School of Mathematics, University of Edinburgh (2011)"},{"key":"617_CR8","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J. Optim. 22(1), 66\u201386 (2012)"},{"key":"617_CR9","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA J. Numer. Anal. 32(4), 1662\u20131695 (2012)"},{"key":"617_CR10","unstructured":"Gratton, S., Sartenaer, A., Toint, Ph.L.: Recursive trust-region methods for multiscale nonlinear optimization. SIAM J. Optim. 19(1), 414\u2013444 (2008)"},{"key":"617_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization. Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer, Dordrecht (2004)"},{"issue":"1","key":"617_CR12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton method and its global performance. Math. Program. Ser. A 108(1), 177\u2013205 (2006)","journal-title":"Math. Program. Ser. A"},{"key":"617_CR13","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":"1","key":"617_CR14","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/0803004","volume":"3","author":"SA Vavasis","year":"1993","unstructured":"Vavasis, S.A.: Black-box complexity of local minimization. SIAM J. Optim. 3(1), 60\u201380 (1993)","journal-title":"SIAM J. Optim."},{"key":"617_CR15","unstructured":"Vicente, L.N.: Worst case complexity of direct search. Preprint 10-17, Department of Mathematics, University of Coimbra, Coimbra, Portugal, Euro J. Comput. Optim. (2010, to appear)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0617-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0617-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0617-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T16:04:34Z","timestamp":1562429074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0617-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,8]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["617"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0617-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,8]]}}}