4.1 Article

Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization

Related references

Note: Only part of the references are listed.
Article Computer Science, Artificial Intelligence

The Split Bregman Method for L1-Regularized Problems

Tom Goldstein et al.

SIAM JOURNAL ON IMAGING SCIENCES (2009)

Article Engineering, Electrical & Electronic

A Douglas-Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery

Patrick L. Combettes et al.

IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING (2007)

Article Computer Science, Software Engineering

A descent method for structured monotone variational inequalities

Cai-Hong Ye et al.

OPTIMIZATION METHODS & SOFTWARE (2007)

Article Operations Research & Management Science

Comparison of two kinds of prediction-correction methods for monotone variational inequalities

BS He et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2004)

Article Mathematics, Applied

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

I Daubechies et al.

COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS (2004)

Article Computer Science, Software Engineering

A new inexact alternating directions method for monotone variational inequalities

BS He et al.

MATHEMATICAL PROGRAMMING (2002)