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

DOI10.1287/IJOC.5.1.84MaRDI QIDQ4202473zbMATH OpenOpenAlexFDO

Authors 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

alternating step methodconnection machineflow algorithmlinear constraintsmonotropic programmingparallel alternating direction methodseparable objective function

Mathematics Subject Classification ID

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

Recommendations

• Monotone variable-metric algorithm for linearly constrained nonlinear programming
• An alogrithm for monotonic global optimization problems^∗
• CPC algorithm for semidefinite monotone variational inequalities
• A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
• Application of the alternating direction method of multipliers to separable convex programming problems
• scientific article; zbMATH DE number 3867079
• scientific article; zbMATH DE number 3853853
• On a homogeneous algorithm for the monotone complementarity problem
• Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
• Two classes of iterative algorithms for solving monotone variational inequality problems

Cited in

(12)

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

This page was built for publication: The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202473)