scientific article; zbMATH DE number 4009672
From MaRDI portal
Publication:3759825
zbMATH Open0622.65046MaRDI QIDQ3759825FDOQ3759825
Authors: E. G. Gol'Shtejn 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3959124
- Applications of the method of partial inverses to convex programming: Decomposition
- scientific article; zbMATH DE number 4068623
- Application of the alternating direction method of multipliers to separable convex programming problems
- Decomposition-aggregation method for convex programming problems
global convergencecoordinationLagrange multiplierdecomposition algorithmblock methodseparable convex optimization problems
Cited In (16)
- Blocked branch-and-bound method
- Method of expansion for optimization problems which do not have a block-separable structure
- Title not available (Why is that?)
- Applications of the method of partial inverses to convex programming: Decomposition
- Title not available (Why is that?)
- Application of the alternating direction method of multipliers to separable convex programming problems
- Modified Lagrangian methods for separable optimization problems
- Direct-dual block method of linear programming
- A variable-penalty alternating directions method for convex optimization
- An algorithm for decomposition coordination of large scale convex programming problems
- Block methods for a convex feasibility problem in a Banach space
- Certain questions in solving block nonlinear optimization problems with coupling variables
- Mixed coordination method for non-linear programming problems with separable structures
- Decomposition methods based on augmented Lagrangians: a survey
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759825)
