A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS

[1]  David F. Shanno,et al.  Computational experience with penalty-barrier methods for nonlinear programming , 1996, Ann. Oper. Res..

[2]  Shinji Mizuno,et al.  Polynomiality of infeasible-interior-point algorithms for linear programming , 1994, Math. Program..

[3]  Stephen J. Wright.  An infeasible-interior-point algorithm for linear complementarity problems , 1994, Math. Program..

[4]  Stavros A. Zenios,et al.  Data parallel computing for network-structured optimization problems , 1994, Comput. Optim. Appl..

[5]  Walter Murray,et al.  Line Search Procedures for the Logarithmic Barrier Function , 1994, SIAM J. Optim..

[6]  Shinji Mizuno,et al.  A primal—dual infeasible-interior-point algorithm for linear programming , 1993, Math. Program..

[7]  John M. Mulvey,et al.  Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure , 1993, INFORMS J. Comput..

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

[9]  Donald Goldfarb,et al.  Exploiting special structure in a primal—dual path-following algorithm , 1993, Math. Program..

[10]  Guangye Li,et al.  An implementation of a parallel primal-dual interior point method for block-structured linear programs , 1992, Comput. Optim. Appl..

[11]  Sanjay Mehrotra,et al.  Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods , 1992, INFORMS J. Comput..

[12]  Frederic H. Murphy,et al.  Exploiting Special Structure in Primal Dual Interior Point Methods , 1992, INFORMS J. Comput..

[13]  Stavros A. Zenios,et al.  On the Fine-Grain Decomposition of Multicommodity Transportation Problems , 1991, SIAM J. Optim..

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

[15]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..

[16]  Shinji Mizuno,et al.  A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..

[17]  Renato D. C. Monteiro,et al.  Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..

[18]  Mauricio G. C. Resende,et al.  Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm , 1989, INFORMS J. Comput..

[19]  Masao Fukushima,et al.  A parallel descent algorithm for convex programming , 1996, Comput. Optim. Appl..