@Article{JCM-23-2,
author = {},
title = {Smoothing by Convex Quadratic Programming},
journal = {Journal of Computational Mathematics},
year = {2005},
volume = {23},
number = {2},
pages = {211--216},
abstract = {<p style="text-align: justify;">In this paper, we study the relaxed smoothing problems with general closed convex constraints. It is pointed out that such problems can be converted to a convex quadratic minimization problem for which there are good programs in software libraries.</p>},
issn = {1991-7139},
doi = {https://doi.org/2005-JCM-8809},
url = {https://global-sci.com/article/85141/smoothing-by-convex-quadratic-programming}
}