一种解可分凸优化问题的分裂算法

A solution separable convex optimization problem of split algorithm

对于三个可分离变量的线性约束可分凸优化问题,提出了一种新的分裂算法,给出了算法的一个性质,最后通过数值实验证明了该方法的可用性和有效性.

For three separable variables separable convex optimization problem with linear constraints,we propose a new division algorithm gives a nature algorithms,numerical experiments finally proved the usability and effectiveness of the method.