[1]孙黎明.一种求解线性规划的投影动态方法(英文)[J].南京师范大学学报(自然科学版),2015,38(04):8.
 Sun Liming.A Projective Dynamic Method for SolvingLinear Programming[J].Journal of Nanjing Normal University(Natural Science Edition),2015,38(04):8.
点击复制

一种求解线性规划的投影动态方法(英文)()
分享到:

《南京师范大学学报》(自然科学版)[ISSN:1001-4616/CN:32-1239/N]

卷:
第38卷
期数:
2015年04期
页码:
8
栏目:
数学
出版日期:
2015-12-30

文章信息/Info

Title:
A Projective Dynamic Method for SolvingLinear Programming
作者:
孙黎明
南京审计学院理学院,江苏 南京 211815
Author(s):
Sun Liming
School of Science,Nanjing Audit University,Nanjing 211815,China
关键词:
线性规划连续性方法变分不等式投影动态方法
Keywords:
linear programmingcontinuous methodvariational inequalityprojective dynamic method
分类号:
90C25,68Q25,62J05
文献标志码:
A
摘要:
提出了一种求解线性规划问题的投影动态方法. 新方法是基于变分不等式的理论和性质而提出的. 将变分不等式的方法进行推导并构建了一个新的ODE系统. 论文给出了初步的试验结果,表明了算法的有效性. 新方法将用于解决大规模的优化问题.
Abstract:
In this paper,we propose a projective dynamic method for minimizing general linear programming. The new method is based on the variational inequality(VI)properties. We extend the variational inequality method to construct a new ODE system. The preliminary numerical results are reported and the new dynamics is shown to be very useful to solve large scale optimization problems.

参考文献/References:

[1]FLETCHER R. Practical methods of optimization[M]. 2nd ed. New York:John Wiley and Sons,1987.
[2]LIAO L Z. A continuous method for convex programming problems[J]. J Optim Theory and Appl,2005(124):207-226.
[3]HE B S. A modified projection and contraction method for a class of linear complementarity problems[J]. J Comput Math,1996(14):54-63.
[4]EAVES B C. On the basic theorem of complementarity[J]. Math Programming,1971(1):68-75.
[5]HARKER P T,PANG J S. A damped-Newton method for the linear complementarity problem[M]//Computational Solution of Nonlinear Systems of Equations:Lectures in Applied Mathematics. USA:American Mathematical Society,1990:265-284.
[6]CICHOCKI A,UNBEHAUEN R. Neural networks for optimization and signal processing[M]. London,UK:Wiley,1993.
[7]HAN Q M,LIAO L Z,QI H D,et al. Stability analysis of gradient-based neural networks for optimization problems[J]. J Global Optim,2001(19):363-381.

相似文献/References:

[1]寇振宇,杨绪兵,张福全,等.L1范数最大间隔分类器设计[J].南京师范大学学报(自然科学版),2018,41(04):59.[doi:10.3969/j.issn.1001-4616.2018.04.010]
 Kou Zhenyu,Yang Xubing,Zhang Fuquan,et al.Design of L1 Norm Maximum Margin Classifier[J].Journal of Nanjing Normal University(Natural Science Edition),2018,41(04):59.[doi:10.3969/j.issn.1001-4616.2018.04.010]

备注/Memo

备注/Memo:
Received data:2015-04-17.
 Foundation item:Supported by the National Natural Science Foundation of China(71302178,11301271)
 Corresponding author:Sun Liming,doctor,majored in numerical optimization. E-mail:sunli_ming@163.com
更新日期/Last Update: 2015-12-30