{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:36:07Z","timestamp":1648974967470},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":[[2001,3]]},"DOI":"10.1016\/s0305-0548(99)00099-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:16:12Z","timestamp":1027617372000},"page":"209-222","source":"Crossref","is-referenced-by-count":0,"title":["Higher-order derivatives in linear and quadratic programming"],"prefix":"10.1016","volume":"28","author":[{"given":"Gianfranco","family":"Corradi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00099-4_BIB1","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0803036","article-title":"Higher-order predictor\u2013corrector interior point methods with application to quadratic objectives","volume":"3","author":"Carpenter","year":"1993","journal-title":"SIAM Journal of Optimization"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","article-title":"Multiple centrality corrections in a primal-dual method for linear programming","volume":"6","author":"Gondzio","year":"1996","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","article-title":"Computational experience with a primal\u2013dual interior point method for linear programming","volume":"152","author":"Lusting","year":"1991","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","article-title":"On the implementation of a primal\u2013dual interior point method","volume":"2","author":"Mehrotra","year":"1992","journal-title":"SIAM Journal of Optimization"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB5","unstructured":"Wright MHW. Interior methods for unconstrained optimization. In: Acta numerica. New York: Cambridge University Press, 1992. p. 341\u2013407."},{"key":"10.1016\/S0305-0548(99)00099-4_BIB6","unstructured":"Dennis JE, Schnabel RB. Numerical methods for unconstrained optimization and nonlinear equation. Englewood Cliffs, NJ: Prentice-Hall, 1983."},{"key":"10.1016\/S0305-0548(99)00099-4_BIB7","doi-asserted-by":"crossref","unstructured":"Powell MJD. A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, GA. editor. Lecture Notes in Mathematics. Vol. 630. Berlin: Springer-Verlag, 1978. p. 144\u201357.","DOI":"10.1007\/BFb0067703"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1080\/02331939308843871","article-title":"Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problems","volume":"27","author":"Amaya","year":"1993","journal-title":"Optimization"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB9","doi-asserted-by":"crossref","unstructured":"Den Hertog D. Interior point approach to linear, quadratic and convex programming. London: Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-94-011-1134-8"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB10","unstructured":"Lagarias JC, Todd MJ, editors. Mathematical developments arising from linear programming. Providence, RI: American Mathematical Society, 1988."},{"key":"10.1016\/S0305-0548(99)00099-4_BIB11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","article-title":"Interior path following primal\u2013dual algorithms. Part I: Linear programming","volume":"44","author":"Montero","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","article-title":"Interior path following primal\u2013dual algorithms. Part II: Linear programming","volume":"44","author":"Montero","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00099-4_BIB13","unstructured":"Resende MGC, Pardalos PM. Interior point algorithms for network optimization problem. In: Beasley, J. editor. Advances in linear and integer programming. Oxford: Oxford University Press, 1996. p. 147\u201387."},{"key":"10.1016\/S0305-0548(99)00099-4_BIB14","unstructured":"Resende MGC, Pardalos PM. Interior point methods for global optimization problems. In: Terkalay, T. editor. Interior points methods of mathematical programming. Dordrecht: Kluwer Academic Publishers, 1996. p. 467\u2013500."},{"key":"10.1016\/S0305-0548(99)00099-4_BIB15","doi-asserted-by":"crossref","unstructured":"Roos C, Vial JPh, editors. Interior points methods for linear programming: theory and practice. Mathematical Programming 52: 1991.","DOI":"10.1007\/BF01582902"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000994?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000994?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T04:10:08Z","timestamp":1578888608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0305054899000994"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00099-4","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}