SMOOTHING BY CONVEX QUADRATIC PROGRAMMING  

作　　者：Bing-shengHe Yu-meiWang 

机构地区：[1]DepartmentofMathematics,NanjingUniversity,Nanjing210093,China

出　　处：《Journal of Computational Mathematics》2005年第2期211-216,共6页计算数学（英文）

摘　　要：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.

分 类 号：O221[理学—运筹学与控制论] G250.76[理学—数学]