{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:13:20Z","timestamp":1720696400768},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"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":[[1985,10]]},"DOI":"10.1007\/bf02591957","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:35:45Z","timestamp":1175168145000},"page":"357-363","source":"Crossref","is-referenced-by-count":15,"title":["Dealing with degeneracy in reduced gradient algorithms"],"prefix":"10.1007","volume":"31","author":[{"given":"R. S.","family":"Dembo","sequence":"first","affiliation":[]},{"given":"J. G.","family":"Klincewicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02591957_CR1","first-page":"37","volume-title":"Optimization","author":"J. Abadie","year":"1969","unstructured":"J. Abadie and J. Carpentier, \u201cGeneralization of the Wolfe reduced gradient method to the case of nonlinear constraints\u201d, in: R. Fletcher, ed.,Optimization (Academic Press, New York, 1969) pp. 37\u201347."},{"key":"BF02591957_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, \u201cNew finite pivoting rules for the simplex method\u201d,Mathematics of Operations Research 2 (1977) 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"BF02591957_CR3","series-title":"Working Paper","volume-title":"A primal truncated-Newton algorithm with application to large-scale nonlinear network optimization","author":"R.S. Dembo","year":"1983","unstructured":"R.S. Dembo, \u201cA primal truncated-Newton algorithm with application to large-scale nonlinear network optimization\u201d, Working Paper No. 72, Series B, School of Organization and Management, Yale University (New Haven, CT, 1983)."},{"key":"BF02591957_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","volume":"15","author":"R.S. Dembo","year":"1981","unstructured":"R.S. Dembo and J.G. Klincewicz, \u201cA scaled reduced gradient algorithm for network flow problems with convex separable costs\u201d,Mathematical Programming Study 15 (1981) 125\u2013147.","journal-title":"Mathematical Programming Study"},{"key":"BF02591957_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/net.3230130310","volume":"13","author":"J.G. Klincewicz","year":"1983","unstructured":"J.G. Klincewicz, \u201cA Newton method for convex separable network flow problems\u201d,Networks 13 (1983) 427\u2013442.","journal-title":"Networks"},{"key":"BF02591957_CR6","volume-title":"Combinatorial optimization, networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial optimization, networks and matroids (Holt, Rinehart & Winston, New York, 1976)."},{"key":"BF02591957_CR7","first-page":"1","volume":"9","author":"C.E. Lemke","year":"1961","unstructured":"C.E. Lemke, \u201cThe constrained gradient method of linear programming\u201d,Journal of the SIAM 9 (1961), 1\u201317.","journal-title":"Journal of the SIAM"},{"key":"BF02591957_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","volume":"14","author":"B.A. Murtagh","year":"1978","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cLarge scale linearly constrained optimization\u201d,Mathematical Programming 14 (1978) 41\u201372.","journal-title":"Mathematical Programming"},{"key":"BF02591957_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BFb0120952","volume":"16","author":"D.F. Shanno","year":"1983","unstructured":"D.F. Shanno and R.E. Marsten, \u201cConjugate gradient methods for linearly constrained nonlinear programming\u201d,Mathematical Programming Study 16 (1983) 149\u2013161.","journal-title":"Mathematical Programming Study"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591957.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591957\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:51Z","timestamp":1558381071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["BF02591957"],"URL":"https:\/\/doi.org\/10.1007\/bf02591957","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}