吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

线性规划的邻域跟踪算法在退化情形下的局部收敛性

马晓珏, 刘红卫   

  1. 1. 西安电子科技大学 数学与统计学院, 西安 710071; 2. 西安邮电大学 理学院, 西安 710121
  • 收稿日期:2015-10-27 出版日期:2016-07-26 发布日期:2016-07-20
  • 通讯作者: 马晓珏 E-mail:mingkeming@126.com

Local Convergence of the NeighborhoodFollowing Algorithmfor Linear Programming under Degenerate Cases

MA Xiaojue1,2, LIU Hongwei1   

  1. 1. School of Mathematics and Statistics, Xidian University, Xi’an 710071, China;2. School of Science, Xi’an University of Posts & Telecommunications, Xi’an 710121, China
  • Received:2015-10-27 Online:2016-07-26 Published:2016-07-20
  • Contact: MA Xiaojue E-mail:mingkeming@126.com

摘要:

基于邻域跟踪算法的局部收敛性, 考察凸二次规划问题, 证明了在更一般的情形下(即无需假设问题非退化), 线性规划的邻域跟踪算法具有局部二次收敛性, 从理论上说明了该算法的数值收敛特性.

关键词: 线性规划, 退化, 局部收敛, 邻域跟踪

Abstract:

Based on local convergence of neighborhoodfollowing algorithm, we investigated convex quadratic programming problem, and proved  linear programming neighborhoodfollowing algorithm has local quadratic convergence in the more general case (there is no need to assume that the problem is non-degenerate), and theoretically explained numerical convergence characteristics of the proposed algorithm.

Key words: linear programming, degeneration, local convergence, neighborhoodfollowing

中图分类号: 

  • O221.1