A class of ADMM-based algorithms for three-block separable convex programming
Sign Up to like & getrecommendations! Published in 2018 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-018-9994-1
Abstract: The alternating direction method of multipliers (ADMM) recently has found many applications in various domains whose models can be represented or reformulated as a separable convex minimization model with linear constraints and an objective function… read more here.
Keywords: admm; block separable; separable convex; algorithm ... See more keywords
Two-Step Fixed-Point Proximity Algorithms for Multi-block Separable Convex Problems
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Scientific Computing"
DOI: 10.1007/s10915-016-0278-6
Abstract: Multi-block separable convex problems recently received considerable attention. Optimization problems of this type minimize separable convex objective functions with linear constraints. Challenges encountered in algorithmic development applying the classic alternating direction method of multipliers (ADMM)… read more here.
Keywords: convex problems; two step; step fixed; multi block ... See more keywords
A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
Sign Up to like & getrecommendations! Published in 2020 at "Numerical Functional Analysis and Optimization"
DOI: 10.1080/01630563.2020.1845730
Abstract: Abstract The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the… read more here.
Keywords: block; convex optimization; linear constraints; optimization ... See more keywords