Smoothing by Convex Quadratic Programming

Author(s)

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.

Keywords:

Relaxed smoothing Convex quadratic programming.
About this article

Abstract View

  • 33217

Pdf View

  • 3563

How to Cite

Smoothing by Convex Quadratic Programming. (2005). Journal of Computational Mathematics, 23(2), 211-216. https://www.global-sci.com/index.php/JCM/article/view/11702