{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:48Z","timestamp":1751881608508},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1007\/bf02592202","type":"journal-article","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:18:08Z","timestamp":1177978688000},"page":"319-331","source":"Crossref","is-referenced-by-count":6,"title":["A class of polynomial variable metric algorithms for linear optimization"],"prefix":"10.1007","volume":"74","author":[{"given":"T.","family":"Rapcs\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. T.","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592202_CR1","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming 1, Affine and projective scaling trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02592202_CR2","first-page":"527","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming II, Legendre transform coordinates and central trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 527\u2013581.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02592202_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01582902","volume":"52","author":"D. Hertog den","year":"1991","unstructured":"D. den Hertog and C. Roos, \u201cA survery of search directions in interior point methods for linear programming,\u201dMathematical Programming 52 (1991) 481\u2013509.","journal-title":"Mathematical Programming"},{"key":"BF02592202_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00934767","volume":"37","author":"D. Gabay","year":"1982","unstructured":"D. Gabay, \u201cMinimizing a differentiable function over a differentiable manifold,\u201dJournal of Optimization Theory and Applications 37 (1982) 177\u2013219.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02592202_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"BF02592202_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, \u201cPolynomial affine algorithms for linear programming,\u201dMathematical Programming 49 (1990) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"BF02592202_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580721","volume":"40","author":"H. Imai","year":"1988","unstructured":"H. Imai, \u201cOn the convexity of the multiplicative version of Karmarkar's potential function.,\u201dMathematical Programming 40 (1988) 29\u201332.","journal-title":"Mathematical Programming"},{"key":"BF02592202_CR8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01582903","volume":"52","author":"M. Iri","year":"1991","unstructured":"M. Iri, \u201cIntegrability of vector and multivector fields associated with interior point methods for linear programming,\u201dMathematical Programming 52 (1991) 511\u2013525.","journal-title":"Mathematical Programming"},{"key":"BF02592202_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jcom.1993.1018","volume":"9","author":"M. Iri","year":"1993","unstructured":"M. Iri, \u201cA proof of the polynomiality of the Iri-Imai method,\u201dJournal of Complexity 9 (1993) 269\u2013290.","journal-title":"Journal of Complexity"},{"key":"BF02592202_CR10","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF01840457","volume":"1","author":"M. Iri","year":"1986","unstructured":"M. Iri and H. Imai, \u201cA multiplicative barrier function method for linear programming,\u201dAlgorithmica 1 (1986) 455\u2013482.","journal-title":"Algorithmica"},{"key":"BF02592202_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar \u201cA new polynomial algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592202_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/conm\/114\/1097865","volume":"114","author":"N. Karmarkar","year":"1990","unstructured":"N. Karmarkar, \u201cRiemannian geometry underlying interior point methods for linear programming,\u201dContemporary Mathematics 114 (1990) 51\u201375.","journal-title":"Contemporary Mathematics"},{"key":"BF02592202_CR13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF02192090","volume":"86","author":"T. Rapcs\u00e1k","year":"1995","unstructured":"T. Rapcs\u00e1k and T.T. Thang, \u201cOn nonlinear coordinate representations of smooth optimization problems,\u201dJournal of Optimization Theory and Applications 86 (1995) 459\u2013489.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02592202_CR14","unstructured":"T. Rapcs\u00e1k, \u201cGeodesic convexity in \u211d + n ,\u201dOptimization (in print)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592202.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592202\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:53Z","timestamp":1558381073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["BF02592202"],"URL":"https:\/\/doi.org\/10.1007\/bf02592202","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}