摘要
建立了一个求解Ｈｉｌｂｅｒｔ空间中约束凸规划的投影算法，并在目标函数与约束函数均是连续Ｆｒｅｃｈｅｔ可微的条件下，利用投影性质证明了算法的下降性和收敛性。
In this paper, a projection methd is given for nonlinear constrained convex program-ming in Hilbert space. The descendence and convergence of the method are proved by usingthe properties of projection , when the functions in programming are Frechet differentiable.
出处
《中南工业大学学报》
CSCD
1995年第5期698-702,共5页
Journal of Central South University of Technology(Natural Science)
关键词
凸规划
投影
收敛
convex programming
projection
convergence
