Login / Signup
A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming.
Yuan Shen
Yannian Zuo
Xiayang Zhang
Published in:
J. Comput. Appl. Math. (2021)
Keyphrases
</>
computational complexity
cost function
optimal solution
convex programming
step size
similarity measure
objective function
np hard
worst case
linear programming
particle swarm optimization
expectation maximization
convex optimization
linear constraints
linearly constrained