{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:26:49Z","timestamp":1648988809809},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0167-6377(92)90039-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"93-98","source":"Crossref","is-referenced-by-count":1,"title":["Generalization of Karmarkar's algorithm to convex homogeneous functions"],"prefix":"10.1016","volume":"11","author":[{"given":"Bahman","family":"Kalantari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90039-6_BIB1","article-title":"New optimality conditions and algorithms for homogeneous and polynomial optimization over spheres","author":"Bagchi","year":"1990"},{"key":"10.1016\/0167-6377(92)90039-6_BIB2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","article-title":"Computing optimal locally constrained steps","volume":"2","author":"Gay","year":"1981","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-6377(92)90039-6_BIB3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02592072","article-title":"An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex","volume":"39","author":"de Ghellinck","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90039-6_BIB4","article-title":"Solving linear programming by bisection and a projective feasibility algorithm","author":"Kalantari","year":"1987"},{"key":"10.1016\/0167-6377(92)90039-6_BIB5","article-title":"Derivation of a generalized and strengthened Gordan theorem from generalized Karmarkar potential and logarithmic barrier functions","author":"Kalantari","year":"1989"},{"key":"10.1016\/0167-6377(92)90039-6_BIB6","series-title":"Mathematical developments arising from linear programming: proceedings of the AMS-IMS-SIAM joint summer conference, 1988","first-page":"243","article-title":"Canonical problems for quadratic programming and projective methods for their solution","volume":"114","author":"Kalantari","year":"1990"},{"key":"10.1016\/0167-6377(92)90039-6_BIB7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01585728","article-title":"Karmarkar's algorithm with improved steps","volume":"46","author":"Kalantari","year":"1990","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90039-6_BIB8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(92)90039-6_BIB9","first-page":"15","article-title":"A different convergence proof of the projective method for linear programming","volume":"7","author":"Padberg","year":"1986","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90039-6_BIB10","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0167-6377(92)90039-6_BIB11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0719026","article-title":"Newton's method with a model trust region modification","volume":"19","author":"Sorensen","year":"1982","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-6377(92)90039-6_BIB12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","article-title":"An extension of Karmarkar's algorithm for linear programming using dual variables","volume":"1","author":"Todd","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0167-6377(92)90039-6_BIB13","first-page":"253","article-title":"A Fully polynomial time projective method","volume":"4","author":"Vial","year":"1988","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90039-6_BIB14","unstructured":"Y. Ye, Private communication, 1989."},{"key":"10.1016\/0167-6377(92)90039-6_BIB15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","article-title":"An extension of Karmarkar's projective algorithms for convex quadratic programming","volume":"44","author":"Ye","year":"1989","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:27:57Z","timestamp":1552901277000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0167637792900396"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90039-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}