{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T11:55:05Z","timestamp":1778846105040,"version":"3.51.4"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1023\/a:1018358602892","type":"journal-article","created":{"date-parts":[[2003,2,6]],"date-time":"2003-02-06T17:08:17Z","timestamp":1044551297000},"page":"5-42","source":"Crossref","is-referenced-by-count":15,"title":["Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets"],"prefix":"10.1007","volume":"9","author":[{"given":"Michael","family":"Patriksson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"145704_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L. Armijo","year":"1966","unstructured":"L. Armijo, \u201cMinimization of functions having Lipschitz continuous first partial derivatives,\u201d Pacific J. Math., vol. 16, pp. 1-3, 1966.","journal-title":"Pacific J. Math."},{"key":"145704_CR2","volume-title":"Studies in Resource Allocation Processes","year":"1977","unstructured":"K.J. Arrow and L. Hurwicz (Eds.), Studies in Resource Allocation Processes, Cambridge University Press: Cambridge, 1977."},{"key":"145704_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/322063.322067","volume":"25","author":"G.M. Baudet","year":"1978","unstructured":"G.M. Baudet, \u201cAsynchronous iterative methods for multiprocessors,\u201d J. ACM, vol. 25, pp. 226-244, 1978.","journal-title":"J. ACM"},{"key":"145704_CR4","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, Nonlinear Programming: Theory and Algorithms, second edition, John Wiley & Sons: New York, NY, 1993.","edition":"second edition"},{"key":"145704_CR5","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TAC.1982.1102980","volume":"AC-27","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas, \u201cDistributed dynamic programming,\u201d IEEE Trans. Automat. Control, vol. AC-27, pp. 610- 616, 1982.","journal-title":"IEEE Trans. Automat. Control"},{"key":"145704_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02591967","volume":"27","author":"D.P. Bertsekas","year":"1983","unstructured":"D.P. Bertsekas, \u201cDistributed asynchronous computation of fixed points,\u201d Math. Programming, vol. 27, pp. 107-120, 1983.","journal-title":"Math. Programming"},{"key":"145704_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF00247653","volume":"1","author":"D.P. Bertsekas","year":"1992","unstructured":"D.P. Bertsekas, \u201cAuction algorithms for network flow problems: A tutorial introduction,\u201d Comput. Optim. Appl., vol. 1, pp. 7-66, 1992.","journal-title":"Comput. Optim. Appl."},{"key":"145704_CR8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1137\/0325006","volume":"25","author":"D.P. Bertsekas","year":"1987","unstructured":"D.P. Bertsekas and D. El Baz, \u201cDistributed asynchronous relaxation methods for convex network flow problems,\u201d SIAM J. Control Optim., vol. 25, pp. 74-85, 1987.","journal-title":"SIAM J. Control Optim."},{"key":"145704_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01589405","volume":"42","author":"D.P. Bertsekas","year":"1988","unstructured":"D.P. Bertsekas and J. Eckstein, \u201cDual coordinate step methods for linear network flow problems,\u201d Math. Programming, vol. 42, pp. 203-243, 1988.","journal-title":"Math. Programming"},{"key":"145704_CR10","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"1989","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall: London, 1989."},{"key":"145704_CR11","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/S0167-8191(05)80062-6","volume":"17","author":"D.P. Bertsekas","year":"1991","unstructured":"D.P. Bertsekas and D.A. Casta\u00f1on, \u201cParallel synchronous and asynchronous implementations of the auction algorithm,\u201d Parallel Comput., vol. 17, pp. 707-732, 1991.","journal-title":"Parallel Comput."},{"key":"145704_CR12","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1137\/1023097","volume":"23","author":"Y. Censor","year":"1981","unstructured":"Y. Censor, \u201cRow-action methods for huge and sparse systems and their applications,\u201d SIAM Rev., vol. 23, pp. 444-466, 1981.","journal-title":"SIAM Rev."},{"key":"145704_CR13","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-8191(05)80072-9","volume":"17","author":"E.D. Chajakis","year":"1991","unstructured":"E.D. Chajakis and S.A. Zenios, \u201cSynchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization,\u201d Parallel Comput., vol. 17, pp. 873-894, 1991.","journal-title":"Parallel Comput."},{"key":"145704_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D. Chazan","year":"1969","unstructured":"D. Chazan and W. Miranker, \u201cChaotic relaxation,\u201d Linear Algebra Appl., vol. 2, pp. 199-222, 1969.","journal-title":"Linear Algebra Appl."},{"key":"145704_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01589409","volume":"42","author":"R.J. Chen","year":"1988","unstructured":"R.J. Chen and R.R. Meyer, \u201cParallel optimization for traffic assignment,\u201d Math. Programming, vol. 42, pp. 327-345, 1988.","journal-title":"Math. Programming"},{"key":"145704_CR16","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TAC.1978.1101718","volume":"AC-23","author":"G. Cohen","year":"1978","unstructured":"G. Cohen, \u201cOptimization by decomposition and coordination: A unified approach,\u201d IEEE Trans. Automat. Control, vol. AC-23, pp. 222-232, 1978.","journal-title":"IEEE Trans. Automat. Control"},{"key":"145704_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00934554","volume":"32","author":"G. Cohen","year":"1980","unstructured":"G. Cohen, \u201cAuxiliary problem principle and decomposition of optimization problems,\u201d J. Optim. Theory Appl., vol. 32, pp. 277-305, 1980.","journal-title":"J. Optim. Theory Appl."},{"key":"145704_CR18","series-title":"Technical Report","volume-title":"Dynamic load balancing for distributed memory multiprocessors","author":"G. Cybenko","year":"1987","unstructured":"G. Cybenko, \u201cDynamic load balancing for distributed memory multiprocessors,\u201d Technical Report 87-1, Department of Computer Science, Tufts University, Medford, MA, 1987."},{"key":"145704_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe, \u201cDecomposition principle for linear programs,\u201d Oper. Res., vol. 8, pp. 101-111, 1960.","journal-title":"Oper. Res."},{"key":"145704_CR20","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/opre.37.3.353","volume":"37","author":"R.S. Dembo","year":"1989","unstructured":"R.S. Dembo, J.M. Mulvey, and S.A. Zenios, \u201cLarge-scale nonlinear network models and their application,\u201d Oper. Res., vol. 37, pp. 353-372, 1989.","journal-title":"Oper. Res."},{"key":"145704_CR21","series-title":"International Series on Applied Systems Analysis","volume-title":"Systems analysis by multilevel methods: With applications to economics and management","author":"Y.M.I. Dirickx","year":"1979","unstructured":"Y.M.I. Dirickx and L.P. Jennergren, \u201cSystems analysis by multilevel methods: With applications to economics and management,\u201d Vol. 6 of International Series on Applied Systems Analysis, John Wiley & Sons: Chichester, 1979."},{"key":"145704_CR22","first-page":"1","volume":"728","author":"R.W. Eash","year":"1979","unstructured":"R.W. Eash, B.N. Janson, and D.E. Boyce, \u201cEquilibrium trip assignment: Advantages and implications for practice,\u201d Transp. Res. Rec., vol. 728, pp. 1-8, 1979.","journal-title":"Transp. Res. Rec."},{"key":"145704_CR23","doi-asserted-by":"crossref","unstructured":"D. El Baz, \u201cA computational experience with distributed asynchronous iterative methods for convex network flow problems,\u201d in Proc. The 28th IEEE Conference on Decision and Control, Tampa, FL, 1989, pp. 590-591.","DOI":"10.1109\/CDC.1989.70183"},{"key":"145704_CR24","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/mnsc.34.3.411","volume":"34","author":"B. Feijoo","year":"1988","unstructured":"B. Feijoo and R.R. Meyer, \u201cPiecewise-linear approximation methods for nonseparable convex optimization,\u201d Management Sci., vol. 34, pp. 411-419, 1988.","journal-title":"Management Sci."},{"key":"145704_CR25","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BFb0120844","volume":"10","author":"J. Fiorot","year":"1979","unstructured":"J.-Ch. Fiorot and P. Huard, \u201cComposition and union of general algorithms of optimization,\u201d Math. Programming Study, vol. 10, pp. 69-85, 1979.","journal-title":"Math. Programming Study"},{"key":"145704_CR26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230010202","volume":"1","author":"H. Frank","year":"1971","unstructured":"H. Frank and W. Chou, \u201cRouting in computer networks,\u201d Networks, vol. 1, pp. 99-122, 1971.","journal-title":"Networks"},{"key":"145704_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine. A User\u2019s Guide and Tutorial for Networked Parallel Computing","author":"A. Geist","year":"1994","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM: Parallel Virtual Machine. A User\u2019s Guide and Tutorial for Networked Parallel Computing, The MIT Press: Cambridge, MA, 1994. Also available in html form on the Internet, URL http:\/\/www.netlib.org\/pvm3\/book\/pvm-book.html."},{"key":"145704_CR28","volume-title":"Scientific Computing: An Introduction with Parallel Computing","author":"G. Golub","year":"1993","unstructured":"G. Golub and J.M. Ortega, Scientific Computing: An Introduction with Parallel Computing, Academic Press: San Diego, CA, 1993."},{"key":"145704_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-8191(89)90073-2","volume":"10","author":"A. Greenbaum","year":"1989","unstructured":"A. Greenbaum, \u201cSynchronization costs on multiprocessors,\u201d Parallel Comput., vol. 10, pp. 3-14, 1989.","journal-title":"Parallel Comput."},{"key":"145704_CR30","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/0909041","volume":"9","author":"J.L. Gustafson","year":"1988","unstructured":"J.L. Gustafson, G.R. Montry, and R.E. Banner, \u201cDevelopment of parallel methods for a 1024-processor hypercube,\u201d SIAM J. Sci. Statist. Comput., vol. 9, pp. 609-638, 1988.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"145704_CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01582255","volume":"48","author":"P.T. Harker","year":"1990","unstructured":"P.T. Harker and J.-S. Pang, \u201cFinite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications,\u201d Mathematical Programming, vol. 48, pp. 161-220, 1990.","journal-title":"Mathematical Programming"},{"key":"145704_CR32","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00e9chal, Convex Analysis and Minimization Algorithms, Springer-Verlag: Berlin, 1993."},{"key":"145704_CR33","volume-title":"Parallel Computers 2: Architecture, Programming and Algorithms","author":"R.W. Hockney","year":"1988","unstructured":"R.W. Hockney and C.R. Jesshope, Parallel Computers 2: Architecture, Programming and Algorithms, Adam Hilger: Bristol, 1988."},{"key":"145704_CR34","volume-title":"Computer Architecture and Parallel Processing","author":"K. Hwang","year":"1985","unstructured":"K. Hwang and F.A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill: Singapore, 1985."},{"key":"145704_CR35","first-page":"153","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"H.T. Kung","year":"1976","unstructured":"H.T. Kung, \u201cSynchronized and asynchronous parallel algorithms for multiprocessors,\u201d in Algorithms and Complexity: New Directions and Recent Results, J.F. Traub (Ed.), Academic Press: New York, NY, pp. 153-200, 1976."},{"key":"145704_CR36","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1080\/02331939308843903","volume":"28","author":"T. Larsson","year":"1993","unstructured":"T. Larsson, A. Migdalas, and M. Patriksson, \u201cA partial linearization method for the traffic assignment problem,\u201d Optimization, vol. 28, pp. 47-61, 1993.","journal-title":"Optimization"},{"key":"145704_CR37","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01582565","volume":"64","author":"T. Larsson","year":"1994","unstructured":"T. Larsson and M. Patriksson, \u201cA class of gap functions for variational inequalities,\u201d Math. Programming, vol. 64, pp. 53-79, 1994.","journal-title":"Math. Programming"},{"key":"145704_CR38","first-page":"249","volume":"49","author":"T. Larsson","year":"1994","unstructured":"T. Larsson and M. Patriksson, \u201cEquilibrium characterizations of solutions to side constrained asymmetric traffic assignment models,\u201d Le Matematiche, vol. 49, pp. 249-280, 1994.","journal-title":"Le Matematiche"},{"key":"145704_CR39","volume-title":"Price-directive traffic management: Applications of side constrained traffic equilibrium models","author":"T. Larsson","year":"1996","unstructured":"T. Larsson and M. Patriksson, \u201cPrice-directive traffic management: Applications of side constrained traffic equilibrium models,\u201d report, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden, 1996."},{"key":"145704_CR40","volume-title":"Optimization Theory for Large Systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon, Optimization Theory for Large Systems, McMillan: New York, NY, 1970."},{"key":"145704_CR41","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-8191(88)90080-4","volume":"6","author":"F.A. Lootsma","year":"1988","unstructured":"F.A. Lootsma and K.M. Ragsdell, \u201cState-of-the-art in parallel nonlinear optimization,\u201d Parallel Comput., vol. 6, pp. 133-155, 1988.","journal-title":"Parallel Comput."},{"key":"145704_CR42","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger, Linear and Nonlinear Programming, second edition, Addison-Wesley, Reading, MA, 1984.","edition":"second edition"},{"key":"145704_CR43","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z.-Q. Luo","year":"1993","unstructured":"Z.-Q. Luo and P. Tseng, \u201cError bounds and convergence analysis of feasible descent methods: A general approach,\u201d Ann. Oper. Res., vol. 46, pp. 157-178, 1993.","journal-title":"Ann. Oper. Res."},{"key":"145704_CR44","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0120849","volume":"10","author":"G.G.L. Meyer","year":"1979","unstructured":"G.G.L. Meyer, \u201cAsymptotic properties of sequences iteratively generated by point-to-set maps,\u201d Math. Programming Study, vol. 10, pp. 115-127, 1979.","journal-title":"Math. Programming Study"},{"key":"145704_CR45","first-page":"233","volume":"280","author":"J.C. Miellou","year":"1975","unstructured":"J.C. Miellou, It\u00e9rations chaotiques \u00e0 retards: \u00e9tudes de la convergence dans le cas d\u2019espaces partiellment ordonn\u00e9s, Comptes Rendus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences (Paris), S\u00e9rie A, vol. 280, pp. 233-236, 1975.","journal-title":"It\u00e9rations chaotiques \u00e0 retards: \u00e9tudes de la convergence dans le cas d\u2019espaces partiellment ordonn\u00e9s"},{"key":"145704_CR46","first-page":"81","volume-title":"Advances in Parallel Computing","author":"J.-C. Miellou","year":"1990","unstructured":"J.-C. Miellou, P. Cortey-Dumont, and M. Boulbrach\u00eane, \u201cPerturbation of fixed-point iterative methods,\u201d in Advances in Parallel Computing, D.J. Evans (Ed.), JAI Press: Greenwich, CT, vol. 1, pp. 81-122, 1990."},{"key":"145704_CR47","volume-title":"Cyclic Linearization vs. Frank-Wolfe Decomposition for Nonlinear Problems over Cartesian Product Sets","author":"A. Migdalas","year":"1990","unstructured":"A. Migdalas, Cyclic Linearization vs. Frank-Wolfe Decomposition for Nonlinear Problems over Cartesian Product Sets, unpublished note, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden, 1990."},{"key":"145704_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-2178-1","volume-title":"Network Economics: A Variational Inequality Approach","author":"A. Nagurney","year":"1993","unstructured":"A. Nagurney, Network Economics: A Variational Inequality Approach, Kluwer Academic Publishers: Dordrecht, The Netherlands, 1993."},{"key":"145704_CR49","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/ijoc.4.2.166","volume":"4","author":"S.S. Nielsen","year":"1992","unstructured":"S.S. Nielsen and S.A. Zenios, \u201cMassively parallel algorithms for singly constrained convex programs,\u201d ORSA J. Comput., vol. 4, pp. 166-181, 1992.","journal-title":"ORSA J. Comput."},{"key":"145704_CR50","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":"145704_CR51","series-title":"Applied Discrete Mathematics and Theoretical Computer Science Series","volume-title":"Topics in Parallel Computing in Mathematical Programming","author":"P.M. Pardalos","year":"1992","unstructured":"P.M. Pardalos, A.T. Phillips, and J.B. Rosen, Topics in Parallel Computing in Mathematical Programming, Vol. 2 of Applied Discrete Mathematics and Theoretical Computer Science Series, Science Press: New York, NY, 1992."},{"key":"145704_CR52","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF00939668","volume":"78","author":"M. Patriksson","year":"1993","unstructured":"M. Patriksson, \u201cPartial linearization methods in nonlinear programming,\u201d J. Optim. Theory Appl., vol. 78, pp. 227-246, 1993.","journal-title":"J. Optim. Theory Appl."},{"key":"145704_CR53","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0377-2217(93)90046-P","volume":"71","author":"M. Patriksson","year":"1993","unstructured":"M. Patriksson, \u201cA unified description of iterative algorithms for traffic equilibria,\u201d European J. Oper. Res., vol. 71, pp. 154-176, 1993.","journal-title":"European J. Oper. Res."},{"key":"145704_CR54","volume-title":"A unified framework of descent algorithms for nonlinear programs and variational inequalities","author":"M. Patriksson","year":"1993","unstructured":"M. Patriksson, \u201cA unified framework of descent algorithms for nonlinear programs and variational inequalities,\u201d Doctoral dissertation, Department of Mathematics, Link\u00f6ping University, Link\u00f6ping, Sweden, 1993."},{"key":"145704_CR55","volume-title":"Cost approximation: A unified framework of descent algorithms for nonlinear programs","author":"M. Patriksson","year":"1994","unstructured":"M. Patriksson, \u201cCost approximation: A unified framework of descent algorithms for nonlinear programs,\u201d report, Department of Mathematics, University of Washington, Seattle, WA, 1994. Revised for possible publication in SIAM J. Optim."},{"key":"145704_CR56","volume-title":"The Traffic Assignment Problem: Models and Methods","author":"M. Patriksson","year":"1994","unstructured":"M. Patriksson, The Traffic Assignment Problem: Models and Methods, VSP: Utrecht, 1994."},{"key":"145704_CR57","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0167-6377(94)90039-6","volume":"16","author":"M. Patriksson","year":"1994","unstructured":"M. Patriksson, \u201cOn the convergence of descent methods for monotone variational inequalities,\u201d Oper. Res. Lett., vol. 16, pp. 265-269, 1994.","journal-title":"Oper. Res. Lett."},{"key":"145704_CR58","volume-title":"A Taxonomy of Classes of Descent Algorithms for Nonlinear Programs and Variational Inequalities","author":"M. Patriksson","year":"1994","unstructured":"M. Patriksson, A Taxonomy of Classes of Descent Algorithms for Nonlinear Programs and Variational Inequalities, report, Department of Mathematics, University of Washington, Seattle, WA, 1994."},{"key":"145704_CR59","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1287\/mnsc.22.1.87","volume":"22","author":"E.R. Petersen","year":"1975","unstructured":"E.R. Petersen, \u201cA primal-dual traffic assignment algorithm,\u201d Management Sci., vol. 22, pp. 87-95, 1975.","journal-title":"Management Sci."},{"key":"145704_CR60","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/ijoc.4.3.235","volume":"4","author":"M.\u00c7. Pinar","year":"1992","unstructured":"M.\u00c7. Pinar and S.A. Zenios, \u201cParallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm,\u201d ORSA J. Comput., vol. 4, pp. 235-249, 1992.","journal-title":"ORSA J. Comput."},{"key":"145704_CR61","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1307\/mmj\/1029000324","volume":"16","author":"R.T. Rockafellar","year":"1969","unstructured":"R.T. Rockafellar, \u201cLocal boundedness of nonlinear, monotone operators,\u201d Michigan Math. J., vol. 16, pp. 397- 407, 1969.","journal-title":"Michigan Math. J."},{"key":"145704_CR62","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970."},{"key":"145704_CR63","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/S0002-9947-1970-0282272-5","volume":"149","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, \u201cOn the maximality of sums of nonlinear monotone operators,\u201d Trans. Amer. Math. Soc., vol. 149, pp. 75-88, 1970.","journal-title":"Trans. Amer. Math. Soc."},{"key":"145704_CR64","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-6377(89)90055-2","volume":"8","author":"A. Ruszczy\u0144ski","year":"1989","unstructured":"A. Ruszczy\u0144ski, \u201cAn augmented Lagrangian decomposition method for block diagonal linear programming problems,\u201d Oper. Res. Lett., vol. 8, pp. 287-294, 1989.","journal-title":"Oper. Res. Lett."},{"key":"145704_CR65","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0801035","volume":"1","author":"G.L. Schultz","year":"1992","unstructured":"G.L. Schultz and R.R. Meyer, \u201cAn interior point method for block angular optimization,\u201d SIAM J. Optim., vol. 1, pp. 583-602, 1992.","journal-title":"SIAM J. Optim."},{"key":"145704_CR66","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0328011","volume":"28","author":"P. Tseng","year":"1990","unstructured":"P. Tseng, \u201cDual ascent methods for problems with strictly convex costs and linear constraints: A unified approach,\u201d SIAM J. Control Optim., vol. 28, pp. 214-242, 1990.","journal-title":"SIAM J. Control Optim."},{"key":"145704_CR67","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00940507","volume":"70","author":"P. Tseng","year":"1991","unstructured":"P. Tseng, \u201cDecomposition algorithm for convex differentiable minimization,\u201d J. Optim. Theory Appl., vol. 70, pp. 109-135, 1991.","journal-title":"J. Optim. Theory Appl."},{"key":"145704_CR68","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/0801036","volume":"1","author":"P. Tseng","year":"1992","unstructured":"P. Tseng, \u201cOn the rate of convergence of a partially asynchronous gradient projection algorithm,\u201d SIAM J. Optim., vol. 1, pp. 603-619, 1992.","journal-title":"SIAM J. Optim."},{"key":"145704_CR69","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1137\/0328040","volume":"28","author":"P. Tseng","year":"1990","unstructured":"P. Tseng, D.P. Bertsekas, and J.N. Tsitsiklis, \u201cPartially asynchronous, parallel algorithms for network flow and other problems,\u201d SIAM J. Control Optim., vol. 28, pp. 678-710, 1990.","journal-title":"SIAM J. Control Optim."},{"key":"145704_CR70","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/moor.16.3.462","volume":"16","author":"P. Tseng","year":"1991","unstructured":"P. Tseng and D.P. Bertsekas, \u201cRelaxation methods for problems with strictly convex costs and linear constraints,\u201d Math. Oper. Res., vol. 16, pp. 462-481, 1991.","journal-title":"Math. Oper. Res."},{"key":"145704_CR71","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/TAC.1986.1104261","volume":"AC-31","author":"J.N. Tsitsiklis","year":"1986","unstructured":"J.N. Tsitsiklis and D.P. Bertsekas, \u201cDistributed asynchronous optimal routing in data networks,\u201d IEEE Trans. Automat. Control, vol. AC-31, pp. 325-332, 1986.","journal-title":"IEEE Trans. Automat. Control"},{"key":"145704_CR72","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0167-8191(89)90079-3","volume":"10","author":"A. \u00dcresin","year":"1989","unstructured":"A. \u00dcresin and M. Dubois, \u201cSufficient conditions for the convergence of asynchronous iterations,\u201d Parallel Comput., vol. 10, pp. 83-92, 1989.","journal-title":"Parallel Comput."},{"key":"145704_CR73","first-page":"302","volume-title":"Advances in Parallel Algorithms","author":"A. \u00dcresin","year":"1992","unstructured":"A. \u00dcresin and M. Dubois, \u201cAsynchronous iterative algorithms: Models and convergence,\u201d in Advances in Parallel Algorithms, L. Kronsj\u00f6 and D. Shumsheruddin (Eds.), Blackwell Scientific Publications: Oxford, Chap. 10, pp. 302-342, 1992."},{"key":"145704_CR74","volume-title":"Convex Analysis: An Introductory Text","author":"J. van Tiel","year":"1984","unstructured":"J. van Tiel, Convex Analysis: An Introductory Text, John Wiley & Sons: Chichester, U.K., 1984."},{"key":"145704_CR75","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1287\/mnsc.16.9.642","volume":"16","author":"N. Zadeh","year":"1969","unstructured":"N. Zadeh, \u201cA note on the cyclic coordinate ascent method,\u201d Management Sci., 16 (1969\/1970), pp. 642-644.","journal-title":"Management Sci."},{"key":"145704_CR76","volume-title":"Nonlinear Programming: A Unified Approach","author":"W.I. Zangwill","year":"1969","unstructured":"W.I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice-Hall: Englewood Cliffs, NJ, 1969."},{"key":"145704_CR77","volume-title":"Nonlinear Functional Analysis and Its Applications II\/B: Nonlinear Monotone Operators","author":"E. Zeidler","year":"1990","unstructured":"E. Zeidler, Nonlinear Functional Analysis and Its Applications II\/B: Nonlinear Monotone Operators, Springer-Verlag: New York, NY, 1990."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018358602892.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018358602892\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018358602892.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:05:38Z","timestamp":1752375938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018358602892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["145704"],"URL":"https:\/\/doi.org\/10.1023\/a:1018358602892","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}