%0 Journal Article
%T A Method of Reduced. Subgradient for Nondifferentiable Convex Programming uuder Linear Constraints<br>线性约束不可微凸规划的既约次梯度法
%A 费景高
%J 计算数学
%D 1991
%I 
%X Making use of part of the information about the subdifferential of the object function,this paper presents an algorithm of reduced subgradient for the nondifferentiable convex pro-gramming. The theoretical model for proving the convergence of the algorithm is also con-tructed. The global convergence of the algorithm is proved and feasibility of the algorithm isdemonstrated.
%K 不可微凸规划
%K 既约次梯度法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=CC77F3CEF526D9CF0B3021650FB4E57E&aid=9AC8F441FEB992993BE4AAEAA2E445D8&yid=116CB34717B0B183&vid=FC0714F8D2EB605D&iid=E158A972A605785F&sid=5FF9F4F7CB1800C7&eid=A04F01817ECB9A48&journal_id=0254-7791&journal_name=计算数学&referenced_num=0&reference_num=2