@Article{NMTMA-2-377,
author = {},
title = {A Coordinate Gradient Descent Method for Nonsmooth Nonseparable Minimization},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2009},
volume = {2},
number = {4},
pages = {377--402},
abstract = {<p style="text-align: justify;">This paper presents a coordinate gradient descent approach for minimizing
the sum of a smooth function and a nonseparable convex function. We find a search
direction by solving a subproblem obtained by a second-order approximation of the
smooth function and adding a separable convex function. Under a local Lipschitzian
error bound assumption, we show that the algorithm possesses global and local linear
convergence properties. We also give some numerical tests (including image recovery
examples) to illustrate the efficiency of the proposed method.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.2009.m9002s},
url = {http://global-sci.org/intro/article_detail/nmtma/6030.html}
}