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

A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM
引用本文:GUO Tiande(Mathematics Department,Qufu Normal University,Qufu 273165,China)WU Shiquan(Institute of Applied Mathematics,Academia Sinia,Beijing 100080,China). A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM[J]. 系统科学与复杂性, 1995, 0(3)
作者姓名:GUO Tiande(Mathematics Department  Qufu Normal University  Qufu 273165  China)WU Shiquan(Institute of Applied Mathematics  Academia Sinia  Beijing 100080  China)
作者单位:GUO Tiande(Mathematics Department,Qufu Normal University,Qufu 273165,China)WU Shiquan(Institute of Applied Mathematics,Academia Sinia,Beijing 100080,China)
摘    要:AMODIFIEDHOMOGENEOUSANDSELF-DUALLINEARPROGRAMMINGALGORITHM¥GUOTiande(MathematicsDepartment,QufuNormalUniversity,Qufu273165,Ch...


A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM
GUO Tiande. A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM[J]. Journal of Systems Science and Complexity, 1995, 0(3)
Authors:GUO Tiande
Abstract:In this paper,we modify the corrector step of the homogeneous and self-dual linear programming algorithm, proposed by Ye, Todd and Mizuno[1]. The duality gap is reduced by a constant fraction per iteration. It is shown that our modified algorithm retains the O(L) iteration complexity and the duality gap converges to zero.
Keywords:Linear programming  interior point algorithms  homogeneity  self-dual.
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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