{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:40:09Z","timestamp":1740116409695,"version":"3.37.3"},"reference-count":32,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2022,3,4]]},"DOI":"10.1080\/10556788.2020.1827254","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T06:54:50Z","timestamp":1601621690000},"page":"692-711","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Simultaneous iterative solutions for the trust-region and minimum eigenvalue subproblem"],"prefix":"10.1080","volume":"37","author":[{"given":"I. G.","family":"Akrotirianakis","sequence":"first","affiliation":[{"name":"SAS Institute","place":["Cary, USA"]}]},{"given":"M.","family":"Gratton","sequence":"additional","affiliation":[{"name":"SAS Institute","place":["Cary, USA"]}]},{"given":"J. D.","family":"Griffin","sequence":"additional","affiliation":[{"name":"SAS Institute","place":["Cary, USA"]}]},{"given":"S.","family":"Yektamaram","sequence":"additional","affiliation":[{"name":"SAS Institute","place":["Cary, USA"]}]},{"given":"W.","family":"Zhou","sequence":"additional","affiliation":[{"name":"SAS Institute","place":["Cary, USA"]}]}],"member":"301","published-online":{"date-parts":[[2020,10]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080727361"},{"key":"e_1_3_3_3_1","unstructured":"I. Bongartz A.R. Conn N.I.M. Gould and Ph. L. Toint CUTE: Constrained and unconstrained testing environment Report 93\/10 D\u00e9partement de Math\u00e9matique Facult\u00e9s Universitaires de Namur 1993."},{"key":"e_1_3_3_4_1","first-page":"1","article-title":"An implicitly restarted Lanczos method for large symmetric eigenvalue problems","volume":"2","author":"Calvetti D.","year":"1994","unstructured":"D. Calvetti, L. Reichel, and D.C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 2 (1994), pp. 1\u201321.","journal-title":"Electron. Trans. Numer. Anal."},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1099-1506(199701\/02)4:1<43::AID-NLA99>3.0.CO;2-Z"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897330194"},{"key":"e_1_3_3_9_1","unstructured":"J.B. Erway and P.E. Gill An interior method for computing a trust-region step Numerical Analysis Report 08-1 Department of Mathematics University of California San Diego La Jolla CA 2008."},{"key":"e_1_3_3_10_1","unstructured":"J.B. Erway P.E. Gill and J.D. Griffin Iterative methods for finding a trust-region step Numerical Analysis Report 07-2 Department of Mathematics University of California San Diego La Jolla CA 2007."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3040-1"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497322735"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/962437.962439"},{"key":"e_1_3_3_14_1","unstructured":"M. Gratton Algorithms for trust-region subproblems with linear inequality constraints Ph.D. diss. University of North Carolina at Chapel Hill 2012."},{"key":"e_1_3_3_15_1","unstructured":"J.D. Griffin Interior-point methods for large-scale nonconvex optimization Ph.D. diss. Department of Mathematics University of California San Diego 2005."},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499356071"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-04-01731-4"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2"},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479895281484"},{"key":"e_1_3_3_20_1","unstructured":"L. Luk\u0161an C. Matonoha and J. Vlcek A shifted Steihaug\u2013Toint method for computing a trust-region step Report No. V914-04 Institute of Computer Science AV CR Pod Vodarenskou Vezi 2 18207 Praha 8 Czech Republic 2004."},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1979-0514820-3"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S105262349928887X"},{"key":"e_1_3_3_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064829598339761"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61582-5"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725532"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0720042"},{"key":"e_1_3_3_29_1","unstructured":"Ph. L. Toint Towards an efficient sparsity exploiting Newton method for minimization in Sparse Matrices and Their Uses I. S Duff ed. Academic Press London and New York 1981 pp. 57\u201388."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898334605"},{"key":"e_1_3_3_31_1","unstructured":"S. Yektamaram Optimization algorithms for machine learning designed for parallel and distributed environments Ph.D. diss. Lehigh University Bethlehem PA 2018."},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1145914"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1332618"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1827254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:50:48Z","timestamp":1740109848000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1827254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3,4]]}},"alternative-id":["10.1080\/10556788.2020.1827254"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1827254","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-09-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-09-14","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}