Publication:4311908
From MaRDI portal
zbMath0816.90109MaRDI QIDQ4311908
Masao Fukushima, Jonathan Eckstein
Publication date: 23 January 1995
alternating direction method; multicommodity flow; data-parallel implementation; minimum convex-cost transportation; multipliers decomposition algorithm; sparse quadratic-cost transportation
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
90B10: Deterministic network models in operations research
65Y05: Parallel numerical computation
Related Items
Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, An improved contraction method for structured monotone variational inequalities, Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm, Vector network equilibrium problems with elastic demands, A new decomposition method for variational inequalities with linear constraints, An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures, An inexact alternating direction method for structured variational inequalities, A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints, On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers, An improved proximal alternating direction method for monotone variational inequalities with separable structure, A class of linearized proximal alternating direction methods, An efficient simultaneous method for the constrained multiple-sets split feasibility problem, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities, Decomposition approaches for constrained spatial auction market problems, An improved proximal-based decomposition method for structured monotone variational inequalities, New parallel descent-like method for solving a class of variational inequalities, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators, A variable-penalty alternating directions method for convex optimization, New decomposition methods for solving variational inequality problems., Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, Nonlinear proximal decomposition method for convex programming, Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm, An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations, A parallel descent algorithm for convex programming, The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem, Alternating direction method for covariance selection models, An alternating direction method of multipliers for elliptic equation constrained optimization problem, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints, A modified alternating projection based prediction-correction method for structured variational inequalities, Proximal alternating directions method for structured variational inequalities, A survey on operator splitting and decomposition of convex programs, Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
Uses Software
