4 search results - page 1 / 1 » A Class of Inexact Variable Metric Proximal Point Algorithms |
125
click to vote
SIAMJO
2008
15 years 2 months ago
2008
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
132
Voted
MOR
2010
15 years 29 days ago
2010
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
160
Voted
JMLR
2012
13 years 5 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
152
Voted
CONSTRAINTS
1998
15 years 2 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...