The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2

DOI10.1287/ijoc.5.1.84zbMath0773.90055OpenAlexW2159135858MaRDI QIDQ4202473

Jonathan Eckstein

Publication date: 31 August 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.5.1.84

zbMATH Keywords

linear constraintsmonotropic programmingconnection machineflow algorithmseparable objective functionalternating step methodparallel alternating direction method

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Data parallel computing for network-structured optimization problems, Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs, Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations, 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, An augmented Lagrangian method for distributed optimization, On the strong convergence of sequences of Halpern type in Hilbert spaces, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, Alternating direction splittings for block angular parallel optimization, Generalized Mann iterates for constructing fixed points in Hilbert spaces, Parallel alternating direction multiplier decomposition of convex programs