ITERATION METHODS TO COMPUTE THE SEPARABLE CONVEX MINIMIZATION PROBLEMS

2016 ◽  
Vol 15 (1) ◽  
pp. 79-91
Author(s):  
Zhen-Yun Peng ◽  
Cheng-Zhi Zhou ◽  
Dan-Dan Du ◽  
Xian-Wei Xiao
Keyword(s):  
Convex Minimization ◽  
Minimization Problems ◽  
Convex Minimization Problems ◽  
Iteration Methods ◽  
Separable Convex Minimization

scholarly journals A Convergent 3-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block

2015 ◽  
Vol 32 (04) ◽  
pp. 1550024 ◽  
Author(s):  
Min Li ◽  
Defeng Sun ◽  
Kim-Chuan Toh
Keyword(s):  
Linear Equation ◽  
Step Length ◽  
Convex Minimization ◽  
Linear Operators ◽  
Strongly Convex ◽  
Minimization Problems ◽  
Alternating Direction ◽  
Convex Minimization Problems ◽  
Separable Convex Minimization ◽  
Equation Constraint

In this paper, we present a semi-proximal alternating direction method of multipliers (sPADMM) for solving 3-block separable convex minimization problems with the second block in the objective being a strongly convex function and one coupled linear equation constraint. By choosing the semi-proximal terms properly, we establish the global convergence of the proposed sPADMM for the step-length [Formula: see text] and the penalty parameter σ ∈ (0, +∞). In particular, if σ > 0 is smaller than a certain threshold and the first and third linear operators in the linear equation constraint are injective, then all the three added semi-proximal terms can be dropped and consequently, the convergent 3-block sPADMM reduces to the directly extended 3-block ADMM with [Formula: see text].

scholarly journals A primal-dual dynamical approach to structured convex minimization problems

2020 ◽  
Vol 269 (12) ◽  
pp. 10717-10757 ◽  
Author(s):  
Radu Ioan Boţ ◽  
Ernö Robert Csetnek ◽  
Szilárd Csaba László
Keyword(s):  
Convex Minimization ◽  
Minimization Problems ◽  
Dynamical Approach ◽  
Convex Minimization Problems ◽  
Primal Dual
Sign in / Sign up

Export Citation Format

Share Document