{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:39:43Z","timestamp":1752460783791},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01299140","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T09:57:33Z","timestamp":1111744653000},"page":"5-28","source":"Crossref","is-referenced-by-count":11,"title":["An interior point method for quadratic programs based on conjugate projected gradients"],"prefix":"10.1007","volume":"2","author":[{"given":"Tamra J.","family":"Carpenter","sequence":"first","affiliation":[]},{"given":"David F.","family":"Shanno","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, ?A variation on Karmarkar's algorithm for solving linear programming problems,?Math. Programming,36 (1986) 174?182.","journal-title":"Math. Programming"},{"key":"CR2","volume-title":"GAMS: A User's Guide","author":"A. Brooke","year":"1988","unstructured":"A. Brooke, D. Kendrick, and A. Meeraus,GAMS: A User's Guide, The Scientific Press, Redwood City, CA, 1988."},{"key":"CR3","series-title":"Technical Report SOR-90-2","volume-title":"Separable quadratic programming via a primal-dual interior point method and its use in a sequential procedure","author":"T.J. Carpenter","year":"1990","unstructured":"T.J. Carpenter, I.J. Lustig, J.M. Mulvey, and D.F. Shanno,Separable quadratic programming via a primal-dual interior point method and its use in a sequential procedure, Technical Report SOR-90-2, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1990."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"R.S. Dembo","year":"1983","unstructured":"R.S. Dembo and T. Steihaug, ?Truncated-Newton algorithms for large-scale unconstrained optimization,?Math. Programming 26 (1983), 190?212.","journal-title":"Math. Programming"},{"key":"CR5","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, ?Iterative solution of problems of linear and quadratic programming,?Soviet Math. Doklady 8 (1967) 674?675.","journal-title":"Soviet Math. Doklady"},{"key":"CR6","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization, John Wiley and Sons, Chichester, England, 1987."},{"key":"CR7","first-page":"26","volume":"19","author":"R. Fourer","year":"1991","unstructured":"R. Fourer and S. Mehrotra, ?Performance of an augmented system approach for solving least-squares problems in an interior point method for linear programming,?COAL Newsletter,19 (1991) 26?30.","journal-title":"COAL Newsletter"},{"key":"CR8","series-title":"Technical Report SOL 91-7","doi-asserted-by":"crossref","DOI":"10.21236\/ADA239191","volume-title":"Solving reduced KKT systems in barrier methods for linear for quadratic programming","author":"P.E. Gill","year":"1991","unstructured":"P.E. Gill, W. Murray, D.B. Poncele\u00f3n, and M.A. Saunders,Solving reduced KKT systems in barrier methods for linear for quadratic programming, Technical Report SOL 91-7, Department of Operations Research, Stanford University, Stanford, CA, 1991."},{"key":"CR9","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, ?On projected Newton methods for linear programming and equivalence to Karmarkar's projective method,?Math. Programming 36 (1986) 183?209.","journal-title":"Math. Programming"},{"key":"CR10","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray, and M.H. Wright,Practical Optimization, Academic Press, New York, NY, 1981."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1991","unstructured":"D. Goldfarb and S. Liu, ?AnO(n 3 L) primal interior point algorithm for convex quadratic programming,?Math. Programming 49 (1991) 325?340.","journal-title":"Math. Programming"},{"key":"CR12","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, ?Large step path-following methods for linear programming, Part I: Barrier function method,?SIAM J. on Optimization,1 (1991) 268?279.","journal-title":"SIAM J. on Optimization"},{"key":"CR14","first-page":"4","volume":"4","author":"M.A. Jenkins","year":"1972","unstructured":"M.A. Jenkins, ?DOMINO-An APL primitive function for matrix inversion-Its implementation and applications,?APL Quote-Quad 4 (1972) 4?15.","journal-title":"APL Quote-Quad"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, ?A new polynomial time algorithm for linear programming,?Combinatorica,4 (1984) 373?395.","journal-title":"Combinatorica"},{"key":"CR16","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger,Linear and Nonlinear Programming, Addison-Wesley Publishing Company, Reading, MA, 1984."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten, and D.F. Shanno, ?On implementing Mehrotra's predictor-corrector interior point method,?SIAM J. on Optimization,2 (1992) 435?449.","journal-title":"SIAM J. on Optimization"},{"key":"CR18","series-title":"Technical Report SOR-90-14","volume-title":"Starting and restarting the primal-dual interior point method","author":"I.J. Lustig","year":"1990","unstructured":"I.J. Lustig, R.E. Marsten, and D.F. Shanno,Starting and restarting the primal-dual interior point method, Technical Report SOR-90-14, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1990."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.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?222.","journal-title":"Linear Algebra and its Applications"},{"key":"CR20","volume-title":"Portfolio Selection: Efficient Diversification of Investments","author":"H.M. Markowitz","year":"1959","unstructured":"H.M. Markowitz,Portfolio Selection: Efficient Diversification of Investments, John Wiley, New York, NY, 1959."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"K.A. McShane","year":"1989","unstructured":"K.A. McShane, C.L. Monma, and D.F. Shanno, ?An implementation of a primal-dual interior point method for linear programming,?ORSA J. on Computing,1 (1989) 70?83.","journal-title":"ORSA J. on Computing"},{"key":"CR22","series-title":"Technical Report 90-03","volume-title":"On the implementation of a (primal-dual) interior point method","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra,On the implementation of a (primal-dual) interior point method, Technical Report 90-03, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1990."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, ?Interior path following primal-dual algorithms. Part I: Linear programming,?Math. Programming,44 (1989) 27?42.","journal-title":"Math. Programming"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, ?Interior path following primal-dual algorithms. Part II: Convex quadratic programming,?Math. Programming,44 (1989) 43?66.","journal-title":"Math. Programming"},{"key":"CR25","series-title":"Technical Report SOL-83-20R","doi-asserted-by":"crossref","DOI":"10.21236\/ADA138522","volume-title":"Minos 5.1 User's Guide","author":"B.A. Murtaugh","year":"1983","unstructured":"B.A. Murtaugh and M.A. Saunders,Minos 5.1 User's Guide, Technical Report SOL-83-20R, Systems Optimization Laboratory, Stanford University, Stanford, CA, 1983."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-1-4613-9617-8_7","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"J.L. Nazareth","year":"1989","unstructured":"J.L. Nazareth, ?Pricing criteria in linear programming,? in N. Megiddo, editor,Progress in Mathematical Programming: Interior Point and Related Methods, Springer-Verlag, New York, NY, 1989, 105?129."},{"key":"CR27","volume-title":"Barrier methods for large-scale quadratic programming","author":"D.B. Poncele\u00f3n","year":"1990","unstructured":"D.B. Poncele\u00f3n,Barrier methods for large-scale quadratic programming, PhD thesis, Department of Computer Science, Stanford University, Standord, CA, 1990."},{"key":"CR28","series-title":"Technical Report 90-6","volume-title":"The predictor-corrector interior-point method as a composite Newton method","author":"R. Tapia","year":"1990","unstructured":"R. Tapia, Y. Zhang, M. Saltzman, and A. Weiser,The predictor-corrector interior-point method as a composite Newton method, Technical Report 90-6, Department of Mathematical Sciences, Rice University, Houston, TX, 1990."},{"key":"CR29","series-title":"Technical Report","volume-title":"ALPO: Another Linear Program Optimizer","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei,ALPO: Another Linear Program Optimizer, Technical Report, AT&T Bell Laboratories, Murray Hill, NJ, 1990."},{"key":"CR30","series-title":"Technical Report SOR-91-10","volume-title":"Symmetric quasi-definite matrices","author":"R.J. Vanderbei","year":"1991","unstructured":"R.J. Vanderbei,Symmetric quasi-definite matrices, Technical Report SOR-91-10, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1991."},{"key":"CR31","series-title":"Technical Report SOR-91-7","volume-title":"Symmetric indefinite systems for interior point methods","author":"R.J. Vanderbei","year":"1991","unstructured":"R.J. Vanderbei and T.J. Carpenter,Symmetric indefinite systems for interior point methods, Technical Report SOR-91-7, Department of Civil Engineering and Operations Research, Princeton University, Princeton, NJ, 1991."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon, and B.F. Freedman, ?A modification of Karmarkar's linear programming algorithm,?Algorithmica,1 (1986) 395?407.","journal-title":"Algorithmica"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","volume":"44","author":"Y. Ye","year":"1989","unstructured":"Y. Ye and E. Tse, ?An extension of Karmarkar's projective algorithm for convex quadratic programming,?Math. Programming,44 (1989) 157?179.","journal-title":"Math. Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299140.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299140\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:08:02Z","timestamp":1556647682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01299140"],"URL":"https:\/\/doi.org\/10.1007\/bf01299140","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}