{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T13:10:42Z","timestamp":1694524242389},"reference-count":14,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2005,7,8]],"date-time":"2005-07-08T00:00:00Z","timestamp":1120780800000},"content-version":"vor","delay-in-days":3721,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numerical Linear Algebra App"],"published-print":{"date-parts":[[1995,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An optimization method is developed based on ellipsoidal trust regions that are defined by conic functions. It provides a powerful unifying theory from which can be derived a variety of interesting and potentially useful optimization algorithms, in particular, conjugate\u2010gradient\u2010like algorithms for nonlinear minimization and Karmarkar\u2010like interior\u2010point algorithms for linear programming.<\/jats:p>","DOI":"10.1002\/nla.1680020305","type":"journal-article","created":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T19:21:29Z","timestamp":1130872889000},"page":"235-241","source":"Crossref","is-referenced-by-count":0,"title":["Trust regions based on conic functions in linear and nonlinear programming"],"prefix":"10.1002","volume":"2","author":[{"given":"J. L.","family":"Nazareth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2005,7,8]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0717023"},{"key":"e_1_2_1_3_2","first-page":"674","article-title":"Iterative solution of problems of linear and quadratic programming","volume":"8","author":"Dikin I. I.","year":"1967","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_2_1_4_2","unstructured":"J. C.GilbertandJ.Nocedal.Global convergence properties of conjugate gradient methods for optimization. Report No. 1268. INRIA\u2010Rocquencourt France 1990."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582287"},{"key":"e_1_2_1_6_2","first-page":"55","article-title":"An interior trust region method for linearly constrained optimization","volume":"19","author":"Gonzaga C. C.","year":"1991","journal-title":"MPS Committee on Algorithms Newsletter"},{"key":"e_1_2_1_7_2","unstructured":"Y. F.HuandC.Storey.Preconditioned low\u2010order Newton methods. Reprot A159. Department of Mathematical Sciences Loughborough University England 1992."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1137\/0803031"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_11"},{"key":"e_1_2_1_10_2","unstructured":"J. L.Nazareth. Quadratic and conic approximating models in linear programming.MPS Committee on Algorithms Bulletin No. 23 (1992) to appear."},{"key":"e_1_2_1_11_2","first-page":"6","article-title":"From Dikin to Karmarkar via scalings, models and trust regions","volume":"2","author":"Nazareth J. L.","year":"1993","journal-title":"SIAG\/OPT Views\u2010and\u2010News"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/1036053"},{"key":"e_1_2_1_13_2","unstructured":"M. J.Todd.A low complexity interior\u2010point algorithm for linear programming. Tech. Report 903. School of OR & IE Cornell University Ithaca NY 1990."},{"key":"e_1_2_1_14_2","unstructured":"M. J.Todd.Another derivation of the Karmarkar direction for linear programming. Tech. Report 995. School of OR & IE Cornell University Ithaca NY 1992."},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9617-8_3"}],"container-title":["Numerical Linear Algebra with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnla.1680020305","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/nla.1680020305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T02:39:34Z","timestamp":1694399974000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/nla.1680020305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["10.1002\/nla.1680020305"],"URL":"https:\/\/doi.org\/10.1002\/nla.1680020305","archive":["Portico"],"relation":{},"ISSN":["1070-5325","1099-1506"],"issn-type":[{"value":"1070-5325","type":"print"},{"value":"1099-1506","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}