Year: 2005
Journal of Computational Mathematics, Vol. 23 (2005), Iss. 2 : pp. 211–216
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2005-JCM-8809
Journal of Computational Mathematics, Vol. 23 (2005), Iss. 2 : pp. 211–216
Published online: 2005-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 6