Separability convex optimization

Aug 29, 2016Abstract: The paper considers the minimization of a separable convex function subject to linear ascending constraints.

Jun 20, 2015Separability is a distinct property from the others. Of course, a separable convex function will require convexity of each fi. But again,

Can ADMM be extended to separable convex optimization problems with linear inequality constraints?

It has been modified, specified, and generalized from various perspectives to tackle more concrete or complicated application problems

Despite its versatility and phenomenal popularity, it remains unknown whether or not the ADMM can be extended to separable convex optimization problems with linear inequality constraints

Can alternating direction multipliers be used for separable convex optimization problems?

Extensions of ADMM for Separable Convex Optimization Problems with Linear Equality or Inequality Constraints Abstract

The alternating direction method of multipliers (ADMM) proposed by Glowinski and Marrocco is a benchmark algorithm for two-block separable convex optimization problems with lin- ear equality constraints

What is a two-block separable convex optimization model?

The two-block separable convex optimization model (1

4) with linear inequality constraints captures particular applications such as the support vector machine with a linear kernel in [6,29] and its variants in [25, 26]

Categories