{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T17:29:12Z","timestamp":1675358952959},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"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":[[1986,6]]},"DOI":"10.1007\/bf02592025","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:54Z","timestamp":1175182434000},"page":"183-209","source":"Crossref","is-referenced-by-count":274,"title":["On projected newton barrier methods for linear programming and an equivalence to Karmarkar\u2019s projective method"],"prefix":"10.1007","volume":"36","author":[{"given":"Philip E.","family":"Gill","sequence":"first","affiliation":[]},{"given":"Walter","family":"Murray","sequence":"additional","affiliation":[]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[]},{"given":"J. A.","family":"Tomlin","sequence":"additional","affiliation":[]},{"given":"Margaret H.","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592025_CR1","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01584344","volume":"13","author":"M. Benichou","year":"1977","unstructured":"M. Benichou, J.M. Gauthier, G. Hentges and G. Ribi\u00e8re, \u201cThe efficient solution of large-scale linear programming problems\u2014some algorithmic techniques and computational results,\u201dMathematical Programming. 13 (1977) 280\u2013322.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR2","volume-title":"Writing Efficient Programs","author":"J.L. Bentley","year":"1982","unstructured":"J.L. Bentley,Writing Efficient Programs (Prentice-Hall, Englewood Cliffs, NJ, 1982)."},{"key":"BF02592025_CR3","volume-title":"Algorithms for Minimization without Derivatives","author":"R.P. Brent","year":"1973","unstructured":"R.P. Brent,Algorithms for Minimization without Derivatives (Prentice-Hall, Englewood Cliffs, NJ, 1973)."},{"key":"BF02592025_CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"BF02592025_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1057947.1057951","volume":"20","author":"J.J. Dongarra","year":"1985","unstructured":"J.J. Dongarra and E. Grosse, \u201cDistribution of mathematical software via electronic mail,\u201dSIGNUM Newsletter 20 (1985) 45\u201347.","journal-title":"SIGNUM Newsletter"},{"key":"BF02592025_CR6","series-title":"Report AERE R-10533","volume-title":"MA27\u2014a set of Fortran subroutines for solving sparse symmetric sets of linear equations","author":"I.S. Duff","year":"1982","unstructured":"I.S. Duff and J.K. Reid, \u201cMA27\u2014a set of Fortran subroutines for solving sparse symmetric sets of linear equations,\u201d Report AERE R-10533, Computer Science and Systems Division, AERE Harwell, (Harwell, England, 1982)."},{"key":"BF02592025_CR7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"I.S. Duff and J.K. Reid, \u201cThe multifrontal solution of indefinite sparse symmetric linear equations,\u201dACM Transactions on Mathematical Software 9 (1983) 302\u2013325.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02592025_CR8","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1002\/nme.1620180804","volume":"18","author":"S.C. Eisenstat","year":"1982","unstructured":"S.C. Eisenstat, M.C. Gursky, M.H. Schultz and A.H. Sherman, \u201cYale sparse matrix package I: The symmetric codes,\u201dInternational Journal of Numerical Methods in Engineering 18 (1982) 1145\u20131151.","journal-title":"International Journal of Numerical Methods in Engineering"},{"key":"BF02592025_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01588310","volume":"18","author":"J. Eriksson","year":"1980","unstructured":"J. Eriksson, \u201cA note on solution of large sparse maximum entropy problems with linear equality constraints,\u201dMathematical Programming 18 (1980) 146\u2013154.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR10","volume-title":"Algorithms for entropy and mathematical programming","author":"J. Eriksson","year":"1981","unstructured":"J. Eriksson, \u201cAlgorithms for entropy and mathematical programming,\u201d Ph.D. Thesis, Link\u00f6ping University, (Link\u00f6ping, Sweden, 1981)."},{"key":"BF02592025_CR11","series-title":"Report LiTH-MAT-R-1985-10","volume-title":"An iterative primal-dual algorithm, for linear programming","author":"J. Eriksson","year":"1985","unstructured":"J. Eriksson, \u201cAn iterative primal-dual algorithm, for linear programming,\u201d Report LiTH-MAT-R-1985-10, Department of Mathematics, Link\u00f6ping University (Link\u00f6ping, Sweden, 1985)."},{"key":"BF02592025_CR12","series-title":"Report LiTH-MAT-R-77-3","volume-title":"Entropy in linear programs\u2014an approach to planning","author":"S. Erlander","year":"1977","unstructured":"S. Erlander, \u201cEntropy in linear programs\u2014an approach to planning,\u201d Report LiTH-MAT-R-77-3, Department of Mathematics, Link\u00f6ping University (Link\u00f6ping, Sweden, 1977)."},{"key":"BF02592025_CR13","first-page":"377","volume-title":"Operations Research Support Methodology","author":"A.V. Fiacco","year":"1979","unstructured":"A.V. Fiacco, \u201cBarrier methods for nonlinear programming,\u201d in: A. Holzman, ed.,Operations Research Support Methodology (Marcel Dekker, New York, NY, 1979) pp. 377\u2013440."},{"key":"BF02592025_CR14","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 (John Wiley and Sons, New York, 1968)."},{"key":"BF02592025_CR15","volume-title":"Practical Methods of Optimization, Volume 2","author":"R. Fletcher","year":"1981","unstructured":"R. Fletcher,Practical Methods of Optimization, Volume 2 (John Wiley and Sons, Chichester, 1981)."},{"key":"BF02592025_CR16","first-page":"203","volume-title":"Optimization","author":"R. Fletcher","year":"1969","unstructured":"R. Fletcher and A.P. McCann, \u201cAcceleration techniques for nonlinear programming,\u201d in: R. Fletcher, ed.,Optimization (Academic Press, London, 1969) pp. 203\u2013213."},{"key":"BF02592025_CR17","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01583795","volume":"23","author":"R. Fourer","year":"1982","unstructured":"R. Fourer, \u201cSolving staircase linear programs by the simplex method, 1: Inversion,\u201dMathematical Programming 23 (1982) 274\u2013313.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR18","volume-title":"The logarithmic potential method of convex programming","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch, \u201cThe logarithmic potential method of convex programming,\u201d University Institute of Economics (Oslo, Norway, 1955)."},{"key":"BF02592025_CR19","volume-title":"Linear dependencies and a mechanized form of the multiplex method for linear programming","author":"K.R. Frisch","year":"1957","unstructured":"K.R. Frisch, \u201cLinear dependencies and a mechanized form of the multiplex method for linear programming,\u201d University Institute of Economics (Oslo, Norway, 1957)."},{"key":"BF02592025_CR20","volume-title":"FOLPI, a forestry-oriented linear programming interpreter","author":"O. Garcia","year":"1984","unstructured":"O. Garcia, \u201cFOLPI, a forestry-oriented linear programming interpreter,\u201d Reprint 1728, New Zealand Forest Service (Christchurch, New Zealand, 1984)."},{"key":"BF02592025_CR21","volume-title":"Solving sparse least-squares problems","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cSolving sparse least-squares problems,\u201d Presentation, Department of Operations Research, Stanford University (Stanford, CA, 1985)."},{"key":"BF02592025_CR22","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J.A. George","year":"1981","unstructured":"J.A. George and J.W.H. Liu,Computer Solution of Large Sparse Positive Definite Systems (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"BF02592025_CR23","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1057931.1057933","volume":"19","author":"J.A. George","year":"1984","unstructured":"J.A. George and E. Ng, \u201cA new release of SPARSPAK\u2014the Waterloo sparse matrix package,\u201dSIGNUM Newsletter 19 (1984) 9\u201313.","journal-title":"SIGNUM Newsletter"},{"key":"BF02592025_CR24","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1137\/0905041","volume":"5","author":"P.E. Gill","year":"1984","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cSparse matrix methods in optimization,\u201dSIAM Journal on Scientific and Statistical Computing 5 (1984) 562\u2013589.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"BF02592025_CR25","series-title":"Report SOL 86-7","volume-title":"A note on nonlinear approaches to linear programming","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cA note on nonlinear approaches to linear programming,\u201d Report SOL 86-7, Department of Operations Research, Stanford University (Stanford, CA, 1986a)."},{"key":"BF02592025_CR26","series-title":"Report SOL 86-8","doi-asserted-by":"crossref","DOI":"10.21236\/ADA170396","volume-title":"Maintaining LU factors of a general sparse matrix","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cMaintaining LU factors of a general sparse matrix,\u201d Report SOL 86-8, Department of Operations Research, Stanford University (Stanford, CA, 1986b). [To appear inLinear Algebra and its Applications.]"},{"key":"BF02592025_CR27","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, London, 1981)."},{"key":"BF02592025_CR28","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0905037","volume":"5","author":"M.T. Heath","year":"1984","unstructured":"M.T. Heath, \u201cNumerical methods for large sparse linear least squares problems,\u201dSIAM Journal on Scientific and Statistical Computing 5 (1984) 497\u2013513.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"BF02592025_CR29","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01589349","volume":"20","author":"J.K. Ho","year":"1981","unstructured":"J.K. Ho and E. Loute, \u201cA set of staircase linear programming test problems,\u201dMathematical Programming 20 (1981) 245\u2013250.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/0101002","volume":"1","author":"A.J. Hoffman","year":"1953","unstructured":"A.J. Hoffman, M. Mannos, D. Sokolowsky, and N. Wiegmann, \u201cComputational experience in solving linear programs,\u201dJournal of the Society for Industrial and Applied Mathematics 1 (1953) 17\u201333.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"BF02592025_CR31","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, \u201cResolution of mathematical programming with nonlinear constraints by the method of centres,\u201d in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"BF02592025_CR32","volume-title":"Sequential Algorithms in Nonlinear Programming","author":"K. Jittorntrum","year":"1978","unstructured":"K. Jittorntrum,Sequential Algorithms in Nonlinear Programming, Ph.D. Thesis, Australian National University (Canberra, Australia, 1978)."},{"key":"BF02592025_CR33","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1017\/S0334270000001715","volume":"20","author":"K. Jittorntrum","year":"1978","unstructured":"K. Jittorntrum and M.R. Osborne, \u201cTrajectory analysis and extrapolation in barrier function methods,\u201dJournal of Australian Mathematical Society Series B 20 (1978) 352\u2013369.","journal-title":"Journal of Australian Mathematical Society Series B"},{"key":"BF02592025_CR34","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dProceedings of the 16th Annual ACM Symposium on the Theory of Computing (1984a) 302\u2013311.","DOI":"10.1145\/800057.808695"},{"key":"BF02592025_CR35","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984b) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592025_CR36","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, \u201cA polynomial algorithm in linear programming,\u201dDoklady Akademiia Nauk SSSR Novaia Seriia 244 (1979) 1093\u20131096. [English translation inSoviet Mathematics Doklady 20 (1979) 191\u2013194.]","journal-title":"Doklady Akademiia Nauk SSSR Novaia Seriia"},{"key":"BF02592025_CR37","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J.W.H. Liu","year":"1985","unstructured":"J.W.H. Liu, \u201cModification of the minimum-degree algorithm by multiple elimination,\u201dACM Transactions on Mathematical Software 11 (1985) 141\u2013153.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02592025_CR38","series-title":"Report SOL 85-5","volume-title":"A practical approach to karmarkar\u2019s algorithm","author":"I.J. Lustig","year":"1985","unstructured":"I.J. Lustig, \u201cA practical approach to karmarkar\u2019s algorithm,\u201d Report SOL 85-5, Department of Operations Research, Stanford University (Stanford, CA, 1985)."},{"key":"BF02592025_CR39","first-page":"367","volume-title":"Numerical Methods for Non-Linear Optimization","author":"R. Mifflin","year":"1972","unstructured":"R. Mifflin, \u201cOn the convergence of the logarithmic barrier function method,\u201d in: F. Lootsma, ed.,Numerical Methods for Non-Linear Optimization (Academic Press, London, 1972) pp. 367\u2013369."},{"key":"BF02592025_CR40","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01580447","volume":"8","author":"R. Mifflin","year":"1975","unstructured":"R. Mifflin, \u201cConvergence bounds for nonlinear programming algorithms,\u201dMathematical Programming 8 (1975) 251\u2013271.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR41","doi-asserted-by":"crossref","unstructured":"C.B. Moler, Private communication (1985).","DOI":"10.2307\/1444847"},{"key":"BF02592025_CR42","series-title":"Report SOL 76-18","volume-title":"Efficient linear search algorithms for the logarithmic barrier function","author":"W. Murray","year":"1976","unstructured":"W. Murray and M.H. Wright, \u201cEfficient linear search algorithms for the logarithmic barrier function,\u201d Report SOL 76-18, Department of Operations Research, Stanford University (Stanford, CA, 1976)."},{"key":"BF02592025_CR43","series-title":"Report SOL 83-20","doi-asserted-by":"crossref","DOI":"10.21236\/ADA138522","volume-title":"MINOS 5.0 user\u2019s guide","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.0 user\u2019s guide,\u201d Report SOL 83-20, Department of Operations Research, Stanford University (Stanford, CA, 1983)."},{"key":"BF02592025_CR44","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, New York, NY, 1970)."},{"key":"BF02592025_CR45","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"C.C. Paige and M.A. Saunders, \u201cLSQR: An algorithm for sparse linear equations and sparse least-squares,\u201dACM Transactions on Mathematical Software 8 (1982a) 43\u201371.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02592025_CR46","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/355993.356000","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"C.C. Paige and M.A. Saunders, \u201cAlgorithm 583. LSQR: Sparse linear equations and least squares problems,\u201dACM Transactions on Mathematical Software 8 (1982b) 195\u2013209.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"BF02592025_CR47","series-title":"Report 648","volume-title":"An extension of Karmarkar\u2019s algorithm for linear programming using dual variables","author":"M.J. Todd","year":"1985","unstructured":"M.J. Todd and B.P. Burrell, \u201cAn extension of Karmarkar\u2019s algorithm for linear programming using dual variables,\u201d Report 648, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1985)."},{"key":"BF02592025_CR48","volume-title":"An experimental approach to Karmarkar\u2019s projective method for linear programming","author":"J.A. Tomlin","year":"1985","unstructured":"J.A. Tomlin, \u201cAn experimental approach to Karmarkar\u2019s projective method for linear programming,\u201d Manuscript, Ketron Inc. (Mountain, View, CA, 1985). [To appear inMathematical Programming Studies.]"},{"key":"BF02592025_CR49","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF02591947","volume":"27","author":"J.A. Tomlin","year":"1983","unstructured":"J.A. Tomlin and J.S. Welch, \u201cFormal optimization of some reduced linear programming problems,\u201dMathematical Programming 27 (1983) 232\u2013240.","journal-title":"Mathematical Programming"},{"key":"BF02592025_CR50","unstructured":"C.B. Tompkins, \u201cProjection methods in calculation,\u201d in: H.A. Antosiewicz, ed.,Proceedings of the Second Symposium in Linear Programming (United States Air Force, Washington, DC, 1955) pp. 425\u2013448."},{"key":"BF02592025_CR51","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800040116","volume":"4","author":"C.B. Tompkins","year":"1957","unstructured":"C.B. Tompkins, \u201cSome methods of computational attack on programming problems, other than the simplex method,\u201dNaval Research Logistics Quarterly 4 (1957) 95\u201396.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02592025_CR52","volume-title":"A modification of Karmarkar\u2019s linear programming algorithm","author":"R.J. Vanderbei","year":"1985","unstructured":"R.J. Vanderbei, M.S. Meketon and B.A. Freedman, \u201cA modification of Karmarkar\u2019s linear programming algorithm,\u201d Manuscript, AT&T Bell Laboratories (Holmdel, NJ, 1985)."},{"key":"BF02592025_CR53","volume-title":"On a maximization problem","author":"J. Neumann von","year":"1947","unstructured":"J. von Neumann, \u201cOn a maximization problem,\u201d Manuscript, Institute for Advanced Study (Princeton, NJ, 1947)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592025.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592025\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:51Z","timestamp":1558395471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["BF02592025"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf02592025","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":["General Mathematics","Software"],"published":{"date-parts":[[1986,6]]}}}