{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T09:17:02Z","timestamp":1648718222397},"reference-count":37,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0305-0548(97)00056-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"333-349","source":"Crossref","is-referenced-by-count":0,"title":["Computational comparisons of dual conjugate gradient algorithms for strictly convex networks"],"prefix":"10.1016","volume":"25","author":[{"given":"Chih-Hang","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jose A.","family":"Ventura","sequence":"additional","affiliation":[]},{"given":"Sharon","family":"Browning","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00056-7_BIB1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02252097","article-title":"On the RAS-algorithm","volume":"23","author":"Bechem","year":"1979","journal-title":"Computing"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB2","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB3","series-title":"Numerical Methods for Nonlinear Optimization","first-page":"39","article-title":"Derivation of Conjugate Gradients","author":"Beale","year":"1972"},{"issue":"1","key":"10.1016\/S0305-0548(97)00056-7_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/356022.356025","article-title":"A Reduced gradient algorithm for nonlinear network problems","volume":"9","author":"Beck","year":"1983","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1","key":"10.1016\/S0305-0548(97)00056-7_BIB5","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0325006","article-title":"Distributed asynchronous relaxation methods for convex network flow problems","volume":"25","author":"Bertsekas","year":"1987","journal-title":"SIAM Journal of Control and Optimization"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB6","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1137\/0325067","article-title":"Relaxation methods for network flow problems with convex arc costs","volume":"25","author":"Bertsekas","year":"1987","journal-title":"SIAM Journal on Control and Optimization"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/1023097","article-title":"Row-action methods for huge sparse systems and their applications","volume":"23","author":"Censor","year":"1981","journal-title":"SIAM Review"},{"issue":"7","key":"10.1016\/S0305-0548(97)00056-7_BIB8","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1287\/mnsc.24.7.747","article-title":"Solving the pipe network analysis problem using optimization techniques","volume":"24","author":"Collins","year":"1978","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/nav.3800330106","article-title":"A Lagrangian relaxation algorithm for the constrained matrix problem","volume":"33","author":"Cottle","year":"1986","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB10","doi-asserted-by":"crossref","DOI":"10.1147\/rd.164.0431","article-title":"Linear Convergence of the Conjugate Gradient Method","author":"Crowder","year":"1972","journal-title":"IBM Journal of Research and Development"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BFb0121178","article-title":"Primal truncated Newton algorithm with application for large-scale nonlinear network optimization","volume":"31","author":"Dembo","year":"1987","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0120941","article-title":"A scaled reduced gradient algorithm for network flow problems with convex separable costs","volume":"15","author":"Dembo","year":"1981","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB13","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/BFb0121105","article-title":"A motivation for using truncated Newton method in a very large-scale nonlinear network problem","volume":"26","author":"Escudero","year":"1986","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","article-title":"Restricted simplicial decomposition: Computation and extensions","volume":"31","author":"Hearn","year":"1987","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BFb0121016","article-title":"Multipoint methods for separable nonlinear networks","volume":"22","author":"Kamesam","year":"1984","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB16","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB17","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1002\/net.3230130310","article-title":"A Newton method for convex separable network flow problems","volume":"13","author":"Klincewicz","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.3230190108","article-title":"Implementing an exact newton method for separable convex transportation problems","volume":"19","author":"Klincewicz","year":"1989","journal-title":"Networks"},{"issue":"5","key":"10.1016\/S0305-0548(97)00056-7_BIB19","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN: A program for generating large-scale capacitated assignment, transportation, and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0305-0548(97)00056-7_BIB20","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/trsc.19.4.445","article-title":"Improved efficiency of the Frank-Wolfe algorithm for convex network programs","volume":"19","author":"LeBlanc","year":"1985","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/S0305-0548(97)00056-7_BIB21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/0325023","article-title":"Iterative methods for large convex quadratic programs: A survey","volume":"25","author":"Lin","year":"1987","journal-title":"SIAM Journal on Control and Optimization"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB22","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01589116","article-title":"On the limited memory BFGS method for large scale optimization","volume":"45","author":"Liu","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB23","series-title":"Nonlinear Programming","author":"Mangasarian","year":"1969"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01609034","article-title":"Testing of a large-scale network optimization program","volume":"15","author":"Muley","year":"1978","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB25","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01588950","article-title":"Large-scale linearly constrained optimization","volume":"14","author":"Murtaugh","year":"1978","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB26","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/net.3230140404","article-title":"Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs","volume":"14","author":"Ohuchi","year":"1984","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB27","first-page":"35","article-title":"Note sur la convergence de methods de directions conjugres","volume":"16","author":"Polak","year":"1969","journal-title":"Revue Francaise Informat Recherche Operationnelle"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB28","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF01580369","article-title":"Some convergence properties of the conjugate gradient method","volume":"11","author":"Powell","year":"1976","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB29","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","article-title":"Restart procedures for the conjugate gradient method","volume":"12","author":"Powell","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB30","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/opre.29.4.763","article-title":"A nonlinear network flow algorithm for maximization of benefits in a hydroelectric power system","volume":"29","author":"Rosenthal","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB31","series-title":"Subroutine FZERO. Numerical Methods and Software","author":"Shampine","year":"1988"},{"issue":"3","key":"10.1016\/S0305-0548(97)00056-7_BIB32","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/moor.3.3.244","article-title":"Conjugate gradient methods with inexact searches","volume":"3","author":"Shanno","year":"1978","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(97)00056-7_BIB33","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0360-8352(88)90026-5","article-title":"Computing the effective resistance in a system of conducting sticks","volume":"14","author":"Ventura","year":"1988","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB34","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/net.3230210407","article-title":"Computational development of a Lagrangian dual approach for quadratic networks","volume":"21","author":"Ventura","year":"1991","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB35","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF02739237","article-title":"Relaxation techniques for strictly convex network problems","volume":"5","author":"Zenios","year":"1985","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB36","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0801024","article-title":"Massive parallel row-action algorithms for some nonlinear transportation problems","volume":"1","author":"Zenios","year":"1991","journal-title":"SIAM Journal on Optimization"},{"key":"10.1016\/S0305-0548(97)00056-7_BIB37","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1287\/mnsc.30.3.308","article-title":"Network programming models for production scheduling in multi-stage multi-item capacitated systems","volume":"30","author":"Zahorik","year":"1984","journal-title":"Management Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000567?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000567?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:46Z","timestamp":1555204906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0305054897000567"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00056-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}