{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:17:54Z","timestamp":1648775874347},"reference-count":19,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0305-0548(95)00068-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"653-666","source":"Crossref","is-referenced-by-count":1,"title":["New infeasible interior-point algorithm based on monomial method"],"prefix":"10.1016","volume":"23","author":[{"given":"Hsieh","family":"Yi-Chih","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis L.","family":"Bricker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00068-2_BIB1","series-title":"Linear and Nonlinear Programming","author":"Luenberger","year":"1989"},{"key":"10.1016\/0305-0548(95)00068-2_BIB2","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\/0305-0548(95)00068-2_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","article-title":"Polynomial-time algorithm based on Newton's method for linear programming","volume":"40","author":"Renegar","year":"1988","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","article-title":"Interior path following primal dual algorithms. Part I: linear programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","article-title":"Interior path following primal-dual algorithms. Part II: convex quadratic programming","volume":"44","author":"Monteiro","year":"1989","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","article-title":"A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power extension","volume":"15","author":"Monteiro","year":"1990","journal-title":"Math. Ops Res."},{"key":"10.1016\/0305-0548(95)00068-2_BIB7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","article-title":"A primal-dual infeasible-interior-point algorithm for linear programming","volume":"61","author":"Kojima","year":"1993","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","article-title":"Polynomality of infeasible-interior-point algorithms for linear programming","volume":"67","author":"Mizuno","year":"1994","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","article-title":"On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem","volume":"4","author":"Zhang","year":"1994","journal-title":"SIAM J. Optimization"},{"key":"10.1016\/0305-0548(95)00068-2_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01581689","article-title":"Global convergence in infeasible-interior-point algorithms","volume":"65","author":"Kojima","year":"1994","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB11","series-title":"15th International Symposium on Mathematical Programming","article-title":"A Mehrotra-type predictor-corrector algorithm with polynomality","author":"Zhang","year":"1994"},{"key":"10.1016\/0305-0548(95)00068-2_BIB12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","article-title":"Path following methods for linear programming","volume":"34","author":"Gonzaga","year":"1992","journal-title":"SIAM Review"},{"key":"10.1016\/0305-0548(95)00068-2_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","article-title":"Interior point methods for linear programming: computational state of the art","volume":"6","author":"Lusting","year":"1994","journal-title":"ORSA J. Comp."},{"key":"10.1016\/0305-0548(95)00068-2_BIB14","article-title":"The monomial method and asymptotic properties of algebraic systems","author":"Burns","year":"1993","journal-title":"Int. J. Numer. Methods Eng."},{"key":"10.1016\/0305-0548(95)00068-2_BIB15","article-title":"The monomial method: extensions, variations, and performance issues","author":"Burns","year":"1993","journal-title":"Int. J. Numer. Methods Eng."},{"key":"10.1016\/0305-0548(95)00068-2_BIB16","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1002\/nme.1620310706","article-title":"A monomial-based methods for solving systems of non-linear algebraic equations","volume":"31","author":"Burns","year":"1991","journal-title":"Int. J. Numer. Methods Eng."},{"key":"10.1016\/0305-0548(95)00068-2_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01582148","article-title":"New techniques for generating quadratic programming test problems","volume":"61","author":"Calamai","year":"1993","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB18","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/BF02591992","article-title":"Convex quadratic programming with one constraint and bounded variables","volume":"36","author":"Dussault","year":"1986","journal-title":"Mathl Program."},{"key":"10.1016\/0305-0548(95)00068-2_BIB19","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(91)90267-Z","article-title":"Algorithms for the solution of quadratic knapsack problems","volume":"152","author":"Pardalos","year":"1991","journal-title":"Linear Algebra Appl."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T20:59:04Z","timestamp":1556657944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0305054895000682"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00068-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}