Volume 23, Issue 2
Smoothing by Convex Quadratic Programming

Bing-Sheng He & Yu-Mei Wang

J. Comp. Math., 23 (2005), pp. 211-216.

Published online: 2005-04

Preview Full PDF 254 2299
Export citation
  • 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.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-23-211, author = {}, title = {Smoothing by Convex Quadratic Programming}, journal = {Journal of Computational Mathematics}, year = {2005}, volume = {23}, number = {2}, pages = {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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8809.html} }
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 -

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.

Bing-Sheng He & Yu-Mei Wang. (1970). Smoothing by Convex Quadratic Programming. Journal of Computational Mathematics. 23 (2). 211-216. doi:
Copy to clipboard
The citation has been copied to your clipboard