{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T05:52:42Z","timestamp":1721368362728},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1007\/bf02206825","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T04:32:15Z","timestamp":1128573135000},"page":"419-437","source":"Crossref","is-referenced-by-count":18,"title":["An interior point method for general large-scale quadratic programming problems"],"prefix":"10.1007","volume":"62","author":[{"given":"Pault T.","family":"Boggs","sequence":"first","affiliation":[]},{"given":"Paul D.","family":"Domich","sequence":"additional","affiliation":[]},{"given":"Janet E.","family":"Rogers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02206825_CR1","doi-asserted-by":"crossref","unstructured":"P.D. Domich, P.T. Boggs, J.E. Rogers and C. Witzgall, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, Linear Algebra and its Applications 152 (1991).","DOI":"10.1016\/0024-3795(91)90280-A"},{"key":"BF02206825_CR2","first-page":"32","volume":"19","author":"P.T. Boggs","year":"1991","unstructured":"P.T. Boggs, P.D. Domich, J.E. Rogers and C. Witzgall, An interior point method for linear and quadratic programming problems. Mathematical Programming Society Committee on Algorithms Newsletter 19 (1991) 32\u201340.","journal-title":"Mathematical Programming Society Committee on Algorithms Newsletter"},{"key":"BF02206825_CR3","unstructured":"P.T. Boggs, JW. Tolle and A.J. Kearsley, A practical algorithm for general large-scale nonlinear optimization problem, NISTIR 5407, National Institute of Standards and Technology (1994), to appear in SIAM Journal of Optimization."},{"key":"BF02206825_CR4","volume-title":"Advances in Optimization and Numerical Analysis: Proc 6th Workshop on Optimization and Numerical Analysis, Oaxaco, Mexico","author":"P.T. Boggs","year":"1994","unstructured":"P.T. Boggs, J.W. Tolle and A.J. Kearsley, A truncated SQP algorithm for large-scale nonlinear programming problems, in:Advances in Optimization and Numerical Analysis: Proc 6th Workshop on Optimization and Numerical Analysis, Oaxaco, Mexico (Kluwer Academic Dordrecht, The Netherlands, 1994)."},{"key":"BF02206825_CR5","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization, 2nd ed. (Wiley, New York, 1987).","edition":"2nd ed."},{"key":"BF02206825_CR6","first-page":"209","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, Resolution of mathematical programming with nonlinear constraints by the method of centres, in:Nonlinear Programming, ed. J. Abadie (North-Holland Amsterdam, 1967) pp. 209\u2013219."},{"key":"BF02206825_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1287\/ijoc.6.1.32","volume":"6","author":"R.J. Vanderbeei","year":"1994","unstructured":"R.J. Vanderbeei, Interior-point methods: Algorithms and formulations, ORSA Journal of Computing 6 (1994) 32\u201334.","journal-title":"ORSA Journal of Computing"},{"key":"BF02206825_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581257","volume":"58","author":"R.J. Vanderbei","year":"1993","unstructured":"R.J. Vanderbei and T.J. Carpenter, Symmetric indefinite systems for interior-point methods Mathematical Programming 58 (1993) 1\u201332.","journal-title":"Mathematical Programming"},{"key":"BF02206825_CR9","unstructured":"D.F. Shanno, private communication (1991)."},{"key":"BF02206825_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01769704","volume":"10","author":"K.M. Anstreicher","year":"1993","unstructured":"K.M. Anstreicher, D. den Hertog and C. Roos, A long step barrier method for convex quadratic programming, Algorithmica 10 (1993) 365.","journal-title":"Algorithmica"},{"key":"BF02206825_CR11","unstructured":"K.M. Anstriecher, On long step path following and SUMT for linear and quadratici programming, Manuscript, Yale School of Organization and Management (August 1990)."},{"key":"BF02206825_CR12","unstructured":"T.F. Coleman and J. Liu, An interior Newton method for quadratic programming, Technical Report TR 93-1388, Cornell University (October 1993)."},{"key":"BF02206825_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, M.G.C. Resende and G. Veiga, An implementatio of Karmarkar's algorithm for linear programming, Mathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"BF02206825_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00938603","volume":"51","author":"R.H.F. Jackson","year":"1986","unstructured":"R.H.F. Jackson and G.P. McCormick, The polyadic structure of factorable function tensors with applications to higher-order minimization techniques. Journal of Optimization Theory and Applications 51 (1986) 63\u201393.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02206825_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01585161","volume":"62","author":"T. Ishihara","year":"1993","unstructured":"T. Ishihara and M. Kojima, On the bigM in the affine scaling algorithm, Mathematical Protramming 62 (1993) 85\u201394.","journal-title":"Mathematical Protramming"},{"key":"BF02206825_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01581253","volume":"59","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, A little theorem of the bigM in interior point algorithms, Mathematical Programming 59 (1993) 361\u2013375","journal-title":"Mathematical Programming"},{"key":"BF02206825_CR17","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, 1981)."},{"key":"BF02206825_CR18","volume-title":"Nonlinear Programming Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968)."},{"key":"BF02206825_CR19","volume-title":"Computer Methods for Circuit Analysis and Design","author":"J. Vlach","year":"1983","unstructured":"J. Vlach and K. Singhal,Computer Methods for Circuit Analysis and Design (Van Nostrand Reinhold, New York, 1983)."},{"key":"BF02206825_CR20","unstructured":"SMPAK User's Guide Version 1.0 (1985)."},{"key":"BF02206825_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/ijoc.1.3.159","volume":"1","author":"P.T. Boggs","year":"1989","unstructured":"P.T. Boggs, P.D. Domich, J.R. Donaldson and C. Witzgall, Algorithmic enhancements to the method of centers for linear programming, ORSA Journal on Computing 1 (1989) 159\u2013171.","journal-title":"ORSA Journal on Computing"},{"key":"BF02206825_CR22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"J.J. Lustig","year":"1991","unstructured":"J.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a primal-dual interior point method for linear programming, Linear Algebra and its Applications 152 (1991) 191\u2013222.","journal-title":"Linear Algebra and its Applications"},{"key":"BF02206825_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","volume":"1","author":"R.E. Marsten","year":"1990","unstructured":"R.E. Marsten, M.J. Saltzman, D.F. Shanno, G.S. Pierce and J.F. Ballintijn, Implementation of a dual affine interior point algorithm for linear programmin, ORSA Journal on Computing 1 (1990) 287\u2013297.","journal-title":"ORSA Journal on Computing"},{"key":"BF02206825_CR24","doi-asserted-by":"crossref","DOI":"10.2172\/6005795","volume-title":"Primal barrier methods for linear programming","author":"A. Marxen","year":"1989","unstructured":"A. Marxen, Primal barrier methods for linear programming, Ph.D. Thesis, Department of Operations Research, Stanford University, Stanford, CA (1989)."},{"key":"BF02206825_CR25","unstructured":"D.M. Gay, Electronic mail distribution of linear programming test problems, Mathematical Programming Society COAL Newsletter 13 (December 1985)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206825.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02206825\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02206825","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T09:44:37Z","timestamp":1626601477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02206825"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["BF02206825"],"URL":"https:\/\/doi.org\/10.1007\/bf02206825","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}