Chapter 5 Parallel computing in network optimization

[1]  Dimitri P. Bertsekas,et al.  Finite Termination of Asynchronous Iterative Algorithms , 1996, Parallel Comput..

[2]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[3]  Hossam A. Zaki.  A comparison of two algorithms for the assignment problem , 1995, Comput. Optim. Appl..

[4]  Xiaoye S. Li,et al.  Data-level parallel solution of min-cost network flow problems using ϵ-relaxations , 1994 .

[5]  Elizabeth R. Jessup,et al.  Parallel Factorization of Structured Matrices Arising in Stochastic Programming , 1994, SIAM J. Optim..

[6]  Dimitri P. Bertsekas,et al.  Parallel Shortest Path Auction Algorithms , 1994, Parallel Comput..

[7]  Jonathan Eckstein.  Parallel alternating direction multiplier decomposition of convex programs , 1994 .

[8]  Masao Fukushima,et al.  Some Reformulations and Applications of the Alternating Direction Method of Multipliers , 1994 .

[9]  W. Hager,et al.  Large Scale Optimization : State of the Art , 1993 .

[10]  Prasoon Tiwari,et al.  An implementation of the ε-relaxation algorithm on the CM-5 , 1993, SPAA '93.

[11]  Dimitri P. Bertsekas,et al.  Parallel Asynchronous Hungarian Methods for the Assignment Problem , 1993, INFORMS J. Comput..

[12]  Paul Tseng,et al.  On the convergence of the exponential multiplier method for convex programming , 1993, Math. Program..

[13]  Stavros A. Zenios,et al.  Proximal minimizations with D-functions and the massively parallel solution of linear network programs , 1993, Comput. Optim. Appl..

[14]  Stavros A. Zenios,et al.  A Massively Parallel Algorithm for Nonlinear Stochastic Network Problems , 1993, Oper. Res..

[15]  Jonathan Eckstein,et al.  Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..

[16]  Jonathan Eckstein,et al.  The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2 , 1993, INFORMS J. Comput..

[17]  Richard S. Barr,et al.  Feature Article - Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions , 1993, INFORMS J. Comput..

[18]  Mustafa Ç. Pinar,et al.  Parallel Block-Partitioning of Truncated Newton for Nonlinear Network Optimization , 1992, SIAM J. Sci. Comput..

[19]  Marc Teboulle,et al.  Entropic Proximal Mappings with Applications to Nonlinear Programming , 1992, Math. Oper. Res..

[20]  Mustafa Ç. Pinar,et al.  Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm , 1992, INFORMS J. Comput..

[21]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[22]  Y. Censor,et al.  Proximal minimization algorithm withD-functions , 1992 .

[23]  David J. DeWitt,et al.  Parallel database systems: the future of high performance database systems , 1992, CACM.

[24]  Stavros A. Zenios,et al.  Massively Parallel Algorithms for Singly Constrained Convex Programs , 1992, INFORMS J. Comput..

[25]  Jeffery L. Kennington,et al.  Generalized Networks: Parallel Algorithms and an Empirical Analysis , 1992, INFORMS J. Comput..

[26]  Panos M. Pardalos,et al.  Advances in Optimization and Parallel Computing , 1992 .

[27]  Robert R. Meyer,et al.  An Interior Point Method for Block Angular Optimization , 1991, SIAM J. Optim..

[28]  Egon Balas,et al.  A parallel shortest augmenting path algorithm for the assignment problem , 1991, JACM.

[29]  Stavros A. Zenios,et al.  On the Massively Parallel Solution of the Assignment Problem , 1991, J. Parallel Distributed Comput..

[30]  Stavros A. Zenios,et al.  Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization , 1991, Parallel Comput..

[31]  Dimitri P. Bertsekas,et al.  Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[32]  Yair Censor,et al.  Massively Parallel Row-Action Algorithms for Some Nonlinear Transportation Problems , 1991, SIAM J. Optim..

[33]  Jeffery L. Kennington,et al.  Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8 , 1991, INFORMS J. Comput..

[34]  John N. Tsitsiklis,et al.  Some aspects of parallel and distributed iterative algorithms - A survey, , 1991, Autom..

[35]  Dimitri P. Bertsekas,et al.  Linear network optimization - algorithms and codes , 1991 .

[36]  Jörg Peters,et al.  The network simplex method on a multiprocessor , 1990, Networks.

[37]  Thomas F. Coleman,et al.  Large-Scale Numerical Optimization , 1990 .

[38]  J. M. Wein,et al.  Massively parallel auction algorithms for the assignment problem , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.

[39]  Donald L. Miller,et al.  Solution of large dense transportation problems using a parallel primal algorithm , 1990 .

[40]  Andrew V. Goldberg,et al.  Finding Minimum-Cost Circulations by Successive Approximation , 1990, Math. Oper. Res..

[41]  P. Tseng.  Dual ascent methods for problems with strictly convex costs and linear constraints: a unified approach , 1990 .

[42]  Janina Kowalski,et al.  Numerical analysis and mathematical modelling , 1990 .

[43]  Y. Censor,et al.  On iterative methods for linearly constrained entropy maximization , 1990 .

[44]  D. El Baz,et al.  A computational experience with distributed asynchronous iterative methods for convex network flow problems , 1989 .

[45]  Stavros A. Zenios,et al.  An Optimal Parallel Implementation of a Quadratic Transportation Algorithm , 1989, PPSC.

[46]  Jonathan Eckstein.  Splitting methods for monotone operators with applications to parallel optimization , 1989 .

[47]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[48]  Ramesh Sharda,et al.  Impacts of recent computer advances on operations research , 1989 .

[49]  Egon Balas,et al.  A PARALLEL SHORTEST PATH ALGORITHM FOR THE ASSIGNMENT PROBLEM , 1989 .

[50]  Robert R. Meyer,et al.  Parallel optimization for traffic assignment , 1988, Math. Program..

[51]  John M. Mulvey,et al.  Vectorization and multitasking of nonlinear network programming algorithms , 1988, Math. Program..

[52]  Yair Censor,et al.  Parallel application of block-iterative methods in medical imaging and radiation therapy , 1988, Math. Program..

[53]  Dimitri P. Bertsekas,et al.  Dual coordinate step methods for linear network flow problems , 1988, Math. Program..

[54]  Stavros A. Zenios,et al.  Nonlinear network optimization on a massively parallel connection machine , 1988 .

[55]  M. D. Chang,et al.  A parallel algorithm for generalized networks , 1988 .

[56]  George B. Dantzig,et al.  Planning under uncertainty using parallel computing , 1988 .

[57]  D. Bertsekas.  The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .

[58]  M. Lescrenier,et al.  Large-Scale Unconstrained Optimization On the Fps 164 and Cray X-MP Vector Processors , 1988 .

[59]  Philippe L. Toint,et al.  Large scale nonlinear optimization on the FPS164 and CRAY X-MP vector processors , 1988 .

[60]  John M. Mulvey,et al.  A distributed algorithm for convex network optimization problems , 1988, Parallel Comput..

[61]  John M. Mulvey,et al.  Nonlinear programming on generalized networks , 1987, TOMS.

[62]  Y. Censor,et al.  On Block-Iterative Entropy Maximization , 1987 .

[63]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[64]  Dimitri P. Bertsekas,et al.  Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems , 1987 .

[65]  Andrew Vladislav Goldberg,et al.  Efficient graph algorithms for sequential and parallel computers , 1987 .

[66]  Andrew V. Goldberg,et al.  Solving minimum-cost flow problems by successive approximation , 1987, STOC.

[67]  R. Dembo.  A primal truncated newton algorithm with application to large-scale nonlinear network optimization , 1987 .

[68]  Robert H. Clark,et al.  Multiprocessor algorithms for generalized network flows , 1987 .

[69]  George R. Desrochers,et al.  Principles of parallel and multiprocessing , 1987 .

[70]  D. Bertsekas,et al.  Distributed asynchronous relaxation methods for convex network flow problems , 1987 .

[71]  D. Bertsekas.  Distributed relaxation methods for linear network flow problems , 1986, 1986 25th IEEE Conference on Decision and Control.

[72]  Randall Rettberg,et al.  Contention is no obstacle to shared-memory multiprocessing , 1986, CACM.

[73]  John M. Mulvey,et al.  Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP , 1986, Oper. Res..

[74]  L. Escudero.  Performance evaluation of independent superbasic sets on nonlinear replicated networks , 1986 .

[75]  R. Cottle,et al.  A Lagrangean relaxation algorithm for the constrained matrix problem , 1986 .

[76]  M. D. Grigoriadis,et al.  An efficient implementation of the network simplex method , 1986 .

[77]  Ron S. Dembo,et al.  Dealing with degeneracy in reduced gradient algorithms , 1985, Math. Program..

[78]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[79]  A. Barrett.  Network Flows and Monotropic Optimization. , 1984 .

[80]  F. Glover,et al.  A comparison of pivot selection rules for primal simplex based network codes , 1983 .

[81]  Trond Steihaug,et al.  Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..

[82]  D. Gabay.  Applications of the method of multipliers to variational inequalities , 1983 .

[83]  M. Fortin,et al.  On decomposition - coordination methods using an augmented Lagrangian , 1983 .

[84]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[85]  Y. Censor.  Row-Action Methods for Huge and Sparse Systems and Their Applications , 1981 .

[86]  Philip E. Gill,et al.  Practical optimization , 1981 .

[87]  Y. Censor,et al.  An iterative row-action method for interval convex programming , 1981 .

[88]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[89]  Jeffery L. Kennington,et al.  A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..

[90]  Richard V. Helgason,et al.  Algorithms for network programming , 1980 .

[91]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[92]  Darwin Klingman,et al.  Enhancements of Spanning Tree Labeling Procedures for Network Optimization. , 1979 .

[93]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[94]  H. Brezis,et al.  Produits infinis de resolvantes , 1978 .

[95]  Fred Glover,et al.  Generalized Networks: A Fundamental Computer-Based Planning Tool , 1978 .

[96]  John M. Mulvey,et al.  Pivot Strategies for Primal-Simplex Network Codes , 1978, JACM.

[97]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[98]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[99]  J. A. Tomlin,et al.  Design of a Linear Programming System for the ILLIAC IV. , 1976 .

[100]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .

[101]  R. Glowinski,et al.  Sur l'approximation, par éléments finis d'ordre un, et la résolution, par pénalisation-dualité d'une classe de problèmes de Dirichlet non linéaires , 1975 .

[102]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[103]  Fred Glover,et al.  Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems , 1973 .

[104]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[105]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[106]  C. Cryer.  The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation , 1971 .

[107]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[108]  L. Bregman.  The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming , 1967 .

[109]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[110]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[111]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[112]  Clifford Hildreth,et al.  A quadratic programming procedure , 1957 .

[113]  D. R. Fulkerson,et al.  A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .