Login / Signup
Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming.
Weiwei Kong
Renato D. C. Monteiro
Published in:
SIAM J. Optim. (2024)
Keyphrases
</>
linearly constrained
worst case
convex optimization
linear constraints
lower bound
upper bound
total variation
computational complexity
programming language
filter bank
objective function
probability distribution
feature vectors
sufficient conditions
space complexity
alternating direction method of multipliers