首页 | 本学科首页   官方微博 | 高级检索  
     

求解一类非线性优化问题的直接方法
引用本文:吴盛亮,王瑞江,刘全进. 求解一类非线性优化问题的直接方法[J]. 河北科技大学学报, 2006, 27(4): 277-278,301
作者姓名:吴盛亮  王瑞江  刘全进
作者单位:河北科技大学经济管理学院,河北石家庄,050018;河北方圆测控技术有限公司,河北石家庄,050091
摘    要:提出了一类带约束的非线性优化问题的新算法———基于动态聚类和数论网格的并行算法,该算法只需计算目标函数的值,无需计算目标函数的导数和设定初始值,是一种直接方法。举例说明了该方法的可行性与有效性。

关 键 词:数论网格  优化问题  动态聚类  Tos算法  序贯过程
文章编号:1008-1542(2006)04-0277-02
收稿时间:2005-12-20
修稿时间:2005-12-20

Direct algorithm for solving a kind of nonlinear optimization problems
WU Sheng-liang,WANG Rui-jiang and LIU Quan-jin. Direct algorithm for solving a kind of nonlinear optimization problems[J]. Journal of Hebei University of Science and Technology, 2006, 27(4): 277-278,301
Authors:WU Sheng-liang  WANG Rui-jiang  LIU Quan-jin
Affiliation:College of Economics and Management, Hebei University of Science and Technology, Shijiazhuang Hebei 050018, China;College of Economics and Management, Hebei University of Science and Technology, Shijiazhuang Hebei 050018, China;Hebei Fangyuan Measurement and Control Technology Company Limited,Shijiazhuang Hebei 050091,China
Abstract:A new algorithm was used for solving a kind of nonlinear optimization problem with restriction a parallel algorithm based on dynamic cluster analysis and number-theoretic net.It is a directness algorithm,and it is not necessary to calculate the derivativeness of the object-function and set up its original value,only to calculate the value of the object-function.Moreover,a numerical example illustrates the feasibility and validity of the method.
Keywords:number-theoretic net  programming problem  dynamic cluster  Tos algorithm  sequential process
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《河北科技大学学报》浏览原始摘要信息
点击此处可从《河北科技大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号