An application of splitting methods to convex partially separable optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6453677
- A splitting method for separable convex programming
- Dual algorithms for solving convex partially separable optimization problems
- scientific article; zbMATH DE number 4043162
- Applications of the method of partial inverses to convex programming: Decomposition
Cited in
(13)- Dual algorithms for solving convex partially separable optimization problems
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- scientific article; zbMATH DE number 4043162 (Why is no real title available?)
- A parallel splitting method for separable convex programs
- Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
- A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems
- On the existence of convex decompositions of partially separable functions
- scientific article; zbMATH DE number 6453677 (Why is no real title available?)
- scientific article; zbMATH DE number 7652690 (Why is no real title available?)
- A splitting algorithm for constrained optimization problems with parabolic equations
This page was built for publication: An application of splitting methods to convex partially separable optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3561567)
