Applications of the method of partial inverses to convex programming: Decomposition

From MaRDI portal





A primal-dual decomposition method is presented to solve the separable convex programming problem. Convergence to a solution and Lagrange multiplier vector occurs from an arbitrary starting point. The method is equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction. In the nonseparable case, it specializes to a known method, the proximal method of multipliers. Conditions are provided which guarantee linear convergence.



Cites work


Cited in
(86)








This page was built for publication: Applications of the method of partial inverses to convex programming: Decomposition

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