Abstract: Sequential Convex Programming (SCP) is an iterative algorithm for solving Nonlinear Programs (NLP) with "convex-over-nonlinear" substructure. At every iteration it solves a convex, but ...
ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results