TY - JOUR
T1 - Smoothing by Convex Quadratic Programming
JO - Journal of Computational Mathematics
VL - 2
SP - 211
EP - 216
PY - 2005
DA - 2005/04
SN - 23
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8809.html
KW - Relaxed smoothing, Convex quadratic programming.
AB - <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>