A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We present an alternating direction scheme for the separable constrained convex programming problem. The predictor is obtained via solving two sub-variational inequalities in a parallel wise at each iteration. The new iterate is obtained by a projection type method along a new descent direction. The new direction is obtained by combining the descent directions using bydoi:10.22436/jnsa.010.01.17 fatcat:l37v34umnraqdooesobwzbqrma