{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T16:40:02Z","timestamp":1749919202612,"version":"3.41.0"},"reference-count":43,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2018,1,2]]},"DOI":"10.1080\/10556788.2016.1270279","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T09:47:36Z","timestamp":1484732856000},"page":"70-91","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":1,"title":["The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction"],"prefix":"10.1080","volume":"33","author":[{"given":"Florian","family":"Jarre","sequence":"first","affiliation":[{"name":"Mathematisches Institut, Universitaet Duesseldorf, Universitaetsstr. 1, 40225 Duesseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Lieder","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Heinrich-Heine-Universitat Dusseldorf, Universitaetsstr. 1, 40225 Dusseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1137\/07070601X"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0339-5"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496304700"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009871"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"CIT0007","series-title":"Control systems and optimization series","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107279667","volume-title":"Optimization Models","author":"Calafiore G.C.","year":"2014"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0286-5"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623498335018"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857"},{"key":"CIT0013","series-title":"Oxford Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534778.001.0001","volume-title":"Analysis on Symmetric Cones","author":"Faraut J.","year":"1994"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(97)00153-2"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009701824047"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120959"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100244"},{"key":"CIT0018","series-title":"A Series of Books in the Mathematical Sciences","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979"},{"key":"CIT0021","unstructured":"A. Griewank,The modification of Newton's method for unconstrained optimization by bounding cubic terms, Technical report NA\/12, Department of Applied Mathematical and Theoretical Physics, University of Cambridge, UK, 1981. doi: 10.13140\/RG.2.1.4097.2960."},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2013.863308"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.02.022"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(98)10032-0"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011378"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.1.149"},{"key":"CIT0031","series-title":"SIAM Stud. Appl. Math.","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Nesterov Y.E.","year":"1993"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0706-8"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.1.1"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495290209"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494261520"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1137\/0805024"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588787"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.2.246.14485"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805750"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1137\/S105262349630060X"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0347-5"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1137\/0722035"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"CIT0046","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580852"},{"key":"CIT0047","first-page":"348","volume":"9","author":"Yuan Y.","year":"1991","journal-title":"J. Comput. Math."},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050133"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0893-2"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581194"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2016.1270279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T15:59:57Z","timestamp":1749916797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2016.1270279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":43,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,9,14]]},"published-print":{"date-parts":[[2018,1,2]]}},"alternative-id":["10.1080\/10556788.2016.1270279"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2016.1270279","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2017,1,18]]},"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"}]}}