{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T18:06:50Z","timestamp":1774375610803,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T00:00:00Z","timestamp":1504742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000769","name":"University of Oxford","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10208-017-9363-y","type":"journal-article","created":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T14:06:07Z","timestamp":1505138767000},"page":"1073-1107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Coralia","family":"Cartis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick 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":[[2017,9,7]]},"reference":[{"key":"9363_CR1","unstructured":"A. Anandkumar and R. Ge. Efficient approaches for escaping high-order saddle points in nonconvex optimization. arXiv.1602.05908 , 2016."},{"key":"9363_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/02331939008843555","volume":"21","author":"A Auslender","year":"1990","unstructured":"A.\u00a0Auslender and R.\u00a0Cominetti. First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions. Optimization 21 (1990), 351\u2013363.","journal-title":"Optimization"},{"key":"9363_CR3","unstructured":"M.\u00a0Baes. Estimate sequence methods: extensions and approximations. Technical Report IFOR Internal Report, ETH Z\u00fcrich, Raemistrasse 101, Z\u00fcrich, Switzerland, 2009."},{"key":"9363_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00934107","volume":"31","author":"A Ben-Tal","year":"1980","unstructured":"A.\u00a0Ben-Tal. Second order and related extremality conditions in nonlinear programming. Journal of Optimization Theory and Applications 31 (1980), 143\u2013165.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"9363_CR5","doi-asserted-by":"crossref","first-page":"1718","DOI":"10.1137\/120864908","volume":"23","author":"W Bian","year":"2013","unstructured":"W.\u00a0Bian and X.\u00a0Chen. Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization. SIAM Journal on Optimization 23 (2013), 1718\u20131741.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR6","unstructured":"W. Bian and X. Chen. Linearly constrained non-Lipschitzian optimization for image restoration. Technical report, Department of Applied Mathematics, Polytechnic University of Hong Kong, Hong Kong, 2015."},{"key":"9363_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10107-014-0753-5","volume":"149","author":"W Bian","year":"2015","unstructured":"W.\u00a0Bian, X.\u00a0Chen, and Y.\u00a0Ye. Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization. Mathematical Programming, Series\u00a0A 149 (2015), 301\u2013327.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR8","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1137\/15M1031631","volume":"26","author":"EG Birgin","year":"2016","unstructured":"E.\u00a0G. Birgin, J.\u00a0L. Gardenghi, J.\u00a0M. Mart\u00ednez, S.\u00a0A. Santos, and Ph.\u00a0L. Toint. Evaluation complexity for nonlinear constrained optimization using unscaled KKT conditions and high-order models. SIAM Journal on Optimization 26 (2016), 951\u2013967.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR9","doi-asserted-by":"publisher","unstructured":"E. G. Birgin, J. L. Gardenghi, J. M. Mart\u00ednez, S. A. Santos, and Ph. L. Toint. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Mathematical Programming, Series\u00a0A. doi: 10.1007\/s10107-016-1065-8 .","DOI":"10.1007\/s10107-016-1065-8"},{"key":"9363_CR10","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/S1052623496306760","volume":"9","author":"JF Bonnans","year":"1999","unstructured":"J.\u00a0F. Bonnans, R.\u00a0Cominetti, and A.\u00a0Shapiro. Second order optimality conditions based on parabolic second order tangent sets. SIAM Journal on Optimization, 9 (1999), 466\u2013492.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR11","unstructured":"N. Boumal, P.-A. Absil, and C. Cartis. Global rates of convergence for nonconvex optimization on manifolds. Technical Report Technical Report arXiv:1605.08101 , Oxford University, Oxford, UK, 2016."},{"key":"9363_CR12","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S0363012901388488","volume":"42","author":"OA Brezhneva","year":"2003","unstructured":"O.\u00a0A. Brezhneva and A.\u00a0Tret\u2019yakov. Optimality conditions for degenerate extremum problems with equality constraints. SIAM Journal on Control and Optimization 42(2003), 729\u2013743.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"9363_CR13","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1016\/j.na.2005.02.022","volume":"63","author":"OA Brezhneva","year":"2005","unstructured":"O.\u00a0A. Brezhneva and A.\u00a0Tret\u2019yakov. The $$p$$ p th-order optimality conditions for inequality constrained optimization problems. Nonlinear Analysis 63 (2005), 1357\u20131366.","journal-title":"Nonlinear Analysis"},{"key":"9363_CR14","doi-asserted-by":"crossref","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM Journal on Optimization 20 (2010), 2833\u20132852.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Mathematical Programming, Series\u00a0A 127(2011), 245\u2013295.","journal-title":"Mathematical Programming, Series\u00a0A"},{"key":"9363_CR16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. Adaptive cubic overestimation methods for unconstrained optimization. Part II: worst-case function-evaluation complexity. Mathematical Programming, Series\u00a0A 130 (2011), 295\u2013319.","journal-title":"Mathematical Programming, Series\u00a0A"},{"key":"9363_CR17","doi-asserted-by":"crossref","first-page":"1662","DOI":"10.1093\/imanum\/drr035","volume":"32","author":"C Cartis","year":"2012","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity. IMA Journal of Numerical Analysis 32 (2012), 1662\u20131695.","journal-title":"IMA Journal of Numerical Analysis"},{"key":"9363_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jco.2011.06.001","volume":"28","author":"C Cartis","year":"2012","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. Complexity bounds for second-order optimality in unconstrained optimization. Journal of Complexity 28 (2012), 93\u2013108.","journal-title":"Journal of Complexity"},{"key":"9363_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-012-0617-9","volume":"144","author":"C Cartis","year":"2013","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. On the complexity of finding first-order critical points in constrained nonlinear optimization. Mathematical Programming, Series\u00a0A 144 (2013), 93\u2013106.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR20","doi-asserted-by":"crossref","first-page":"1553","DOI":"10.1137\/120869687","volume":"23","author":"C Cartis","year":"2013","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. SIAM Journal on Optimization 23 (2013), 1553\u20131574.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR21","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/130915546","volume":"53","author":"C Cartis","year":"2015","unstructured":"C.\u00a0Cartis, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. On the evaluation complexity of constrained nonlinear least-squares and general constrained nonlinear optimization using second-order methods. SIAM Journal on Numerical Analysis 53 (2015), 836\u2013851.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"9363_CR22","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1080\/02331934.2013.869809","volume":"64","author":"C Cartis","year":"2015","unstructured":"C.\u00a0Cartis, Ph.\u00a0R. Sampaio, and Ph.\u00a0L. Toint. Worst-case complexity of first-order non-monotone gradient-related algorithms for unconstrained optimization. Optimization 64 (2015), 1349\u20131361.","journal-title":"Optimization"},{"key":"9363_CR23","doi-asserted-by":"publisher","unstructured":"C. Cartis and K. Scheinberg. Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Mathematical Programming, Series A. doi: 10.1007\/s10107-017-1137-4 .","DOI":"10.1007\/s10107-017-1137-4"},{"key":"9363_CR24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01445166","volume":"21","author":"R Cominetti","year":"1990","unstructured":"R.\u00a0Cominetti. Metric regularity, tangent sets and second-order optimality conditions. Applied Mathematics & Optimization, 21 (1990), 265\u2013287.","journal-title":"Applied Mathematics & Optimization"},{"key":"9363_CR25","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"A.\u00a0R. Conn, N.\u00a0I.\u00a0M. Gould, and Ph.\u00a0L. Toint. Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia, USA, 2000."},{"key":"9363_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"F.\u00a0E. Curtis, D.\u00a0P. Robinson, and M.\u00a0Samadi. A trust-region algorithm with a worst-case iteration complexity of $$O(\\epsilon ^{-3\/2})$$ O ( \u03f5 - 3 \/ 2 ) for nonconvex optimization. Mathematical Programming, Series A 162 (2017), 1\u201332.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR27","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"M.\u00a0Dodangeh, L.\u00a0N. Vicente, and Z.\u00a0Zhang. On the optimal order of worst case complexity of direct search. Optimization Letters 10 (2016), 699\u2013708.","journal-title":"Optimization Letters"},{"key":"9363_CR28","doi-asserted-by":"publisher","unstructured":"J. P. Dussault. ARC $$_q$$ q : a new adaptive regularization by cubics. Optimization Methods and Software. doi: 10.1080\/10556788.2017.1322080","DOI":"10.1080\/10556788.2017.1322080"},{"key":"9363_CR29","unstructured":"R. Garmanjani, D. J\u00fadice, and L. N. Vicente. Trust-region methods without using derivatives: Worst case complexity and the non-smooth case. SIAM Journal on Optimization, 26 (2016), 1987\u20132011."},{"key":"9363_CR30","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/moor.13.4.629","volume":"13","author":"J Gauvin","year":"1988","unstructured":"J.\u00a0Gauvin and R.\u00a0Janin. Directional behavior of optimal solutions in nonlinear mathematical programming. Mathematics of Operations Research 13 (1988), 629\u2013649.","journal-title":"Mathematics of Operations Research"},{"key":"9363_CR31","first-page":"1721","volume":"21","author":"D Ge","year":"2011","unstructured":"D.\u00a0Ge, X.\u00a0Jiang, and Y.\u00a0Ye. A note on the complexity of $${L}_p$$ L p minimization. Mathematical Programming, Series\u00a0A 21 (2011), 1721\u20131739.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"S.\u00a0Ghadimi and G.\u00a0Lan. Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Mathematical Programming, Series\u00a0A, 156 (2016), 59\u2013100.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR33","doi-asserted-by":"crossref","unstructured":"N. I. M. Gould and S. Leyffer. An introduction to algorithms for nonlinear optimization. In A. W. Craig J. F. Blowey and T. Shardlow, editors, Frontiers in Numerical Analysis (Durham 2002), Heidelberg, Berlin, New York, 2003. Springer Verlag, pp. 109\u2013197.","DOI":"10.1007\/978-3-642-55692-0_4"},{"key":"9363_CR34","unstructured":"G. N. Grapiglia, J. Yuan, and Y. Yuan. Nonlinear stepsize control algorithms: Complexity bounds for first and second-order optimality. Journal of Optimization Theory and Applications, 171 (2016), 980\u2013997."},{"key":"9363_CR35","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"G.\u00a0N. Grapiglia, J.\u00a0Yuan, and Y.\u00a0Yuan. On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Mathematical Programming, Series\u00a0A 152 (2015), 491\u2013520.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR36","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"S.\u00a0Gratton, C.\u00a0W. Royer, L.\u00a0N. Vicente, and Z.\u00a0Zhang. Direct search based on probabilistic descent. SIAM Journal on Optimization 25 (2015), 1515\u20131541.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR37","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/050623012","volume":"19","author":"S Gratton","year":"2008","unstructured":"S.\u00a0Gratton, A.\u00a0Sartenaer, and Ph.\u00a0L. Toint. Recursive trust-region methods for multiscale nonlinear optimization. SIAM Journal on Optimization, 19 (2008), 414\u2013444.","journal-title":"SIAM Journal on Optimization"},{"key":"9363_CR38","unstructured":"H. Hancock. The Theory of Maxima and Minima. The Athenaeum Press, Ginn & Co, NewYork, USA, 1917. Available on line at https:\/\/archive.org\/details\/theoryofmaximami00hancuoft ."},{"key":"9363_CR39","doi-asserted-by":"crossref","unstructured":"J. B. Hiriart-Urruty and C. Lemar\u00e9chal. Convex Analysis and Minimization Algorithms. Part 1: Fundamentals. Springer Verlag, Heidelberg, Berlin, New York, 1993.","DOI":"10.1007\/978-3-662-02796-7_1"},{"key":"9363_CR40","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1137\/1015073","volume":"15","author":"W Hogan","year":"1973","unstructured":"W.\u00a0Hogan. Point-to-set maps in mathematical programming. SIAM Review 15 (1973), 591\u2013603.","journal-title":"SIAM Review"},{"key":"9363_CR41","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1080\/10556788.2011.638924","volume":"28","author":"F Jarre","year":"2013","unstructured":"F.\u00a0Jarre. On Nesterov\u2019s smooth Chebyshev-Rosenbrock function. Optimization Methods and Software 28 (2013), 478\u2013500.","journal-title":"Optimization Methods and Software"},{"key":"9363_CR42","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s10589-010-9363-1","volume":"51","author":"S Lu","year":"2012","unstructured":"S.\u00a0Lu, Z.\u00a0Wei, and L.\u00a0Li. A trust-region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Computational Optimization and Applications 51 (2012), 551\u2013573.","journal-title":"Computational Optimization and Applications"},{"key":"9363_CR43","unstructured":"J. M. Mart\u00ednez. On high-order model regularization for constrained optimization. Technical report, Department of Applied Mathematics, IMECC-UNICAMP, Campinas, Brasil, February 2017."},{"key":"9363_CR44","doi-asserted-by":"crossref","unstructured":"J. M. Mart\u00ednez and M. Raydan. Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. Technical report, Department of Mathematics, IMECC-UNICAMP, University of Campinas, Campinas, Brazil, November 2015.","DOI":"10.1007\/s10898-016-0475-8"},{"key":"9363_CR45","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"J.\u00a0J. Moreau. D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. Comptes-Rendus de l\u2019Acad\u00e9mie des Sciences (Paris) 255 (1962), 238\u2013240.","journal-title":"Comptes-Rendus de l\u2019Acad\u00e9mie des Sciences (Paris)"},{"key":"9363_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization","author":"Yu Nesterov","year":"2004","unstructured":"Yu. Nesterov. Introductory Lectures on Convex Optimization. Applied Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004."},{"key":"9363_CR47","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Yu Nesterov","year":"2006","unstructured":"Yu. Nesterov and B.\u00a0T. Polyak. Cubic regularization of Newton method and its global performance. Mathematical Programming, Series\u00a0A 108 (2006), 177\u2013205.","journal-title":"Mathematical Programming, Series A"},{"key":"9363_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"J.\u00a0Nocedal and S.\u00a0J. Wright. Numerical Optimization. Series in Operations Research. Springer Verlag, Heidelberg, Berlin, New York, 1999."},{"key":"9363_CR49","volume-title":"Calcolo differenziale e principii di calcolo integrale","author":"G Peano","year":"1884","unstructured":"G.\u00a0Peano. Calcolo differenziale e principii di calcolo integrale. Fratelli Bocca, Roma, Italy, 1884."},{"key":"9363_CR50","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analyis","author":"RT Rockafellar","year":"1970","unstructured":"R.\u00a0T. Rockafellar. Convex Analyis. Princeton University Press, Princeton, USA, 1970."},{"key":"9363_CR51","volume-title":"Complexity in inexact proximal Newton methods","author":"K Scheinberg","year":"2014","unstructured":"K.\u00a0Scheinberg and X.\u00a0Tang. Complexity in inexact proximal Newton methods. Technical report, Lehigh Uinversity, Bethlehem, USA, 2014."},{"key":"9363_CR52","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01443623","volume":"18","author":"A Shapiro","year":"1988","unstructured":"A.\u00a0Shapiro. Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton. Applied Mathematics & Optimization 18 (1988), 215\u2013229.","journal-title":"Applied Mathematics & Optimization"},{"key":"9363_CR53","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s00245-009-9094-9","volume":"62","author":"K Ueda","year":"2010","unstructured":"K.\u00a0Ueda and N.\u00a0Yamashita. Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization. Applied Mathematics & Optimization 62 (2010), 27\u201346.","journal-title":"Applied Mathematics & Optimization"},{"key":"9363_CR54","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10957-010-9731-0","volume":"147","author":"K Ueda","year":"2010","unstructured":"K.\u00a0Ueda and N.\u00a0Yamashita. On a global complexity bound of the Levenberg-Marquardt method. Journal of Optimization Theory and Applications 147 (2010), 443\u2013453.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"9363_CR55","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"L.\u00a0N. Vicente. Worst case complexity of direct search. EURO Journal on Computational Optimization 1 (2013), 143\u2013153.","journal-title":"EURO Journal on Computational Optimization"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-017-9363-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-017-9363-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T05:48:13Z","timestamp":1570081693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-017-9363-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,7]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9363"],"URL":"https:\/\/doi.org\/10.1007\/s10208-017-9363-y","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,7]]}}}