Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
From MaRDI portal
Publication:4998188
DOI10.4208/ATA.OA-SU13zbMath1474.90331MaRDI QIDQ4998188
Publication date: 1 July 2021
Published in: Analysis in Theory and Applications (Search for Journal in Brave)
convex programmingaugmented Lagrangian methodJacobian splittingmulti-block separable modelunified algorithmic framework
Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ A parallel splitting ALM-based algorithm for separable convex programming
This page was built for publication: Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
