%0 Journal Article
%T A SUPERLINEARLY CONVERGENT ALGORITHM BY THE SUBOPTIMAL METHOD FOR LINEARLY CONSTRAINED CONVEX PROGRAMMING PROBLEMS<br>一个用次最优化方法解线性约束凸规划的超线性收敛算法
%A WANG WEI
%A <br>王薇
%J 系统科学与数学
%D 1990
%I 
%X In this papel,the variable metric without constraints is combined with the method of subo-ptimizations on manifolds to solve the nonlinear programming problems with linear contraintsand an algorithm which is superlinearly convergent is given.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=EB980D2C7DF46938C136C48A612F262E&yid=8D39DA2CB9F38FD0&vid=F3090AE9B60B7ED1&iid=CA4FD0336C81A37A&sid=301DD465F7AF90CF&eid=51763B1CD389C4AD&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0