期刊文献+

求解线性约束凸规划问题的预估校正内点法

Predictor-corrector Interior-point Method for Solving Linearly Constrained Convex Programming
原文传递
导出
摘要 提出一个求解线性约束凸规划问题的预估校正内点法 ,方法对初始迭代点的可行性没有任何要求 ,并证明了所给方法等价于 1阶扰动复合牛顿法 ,且给出了一些数值试验结果 . A predictor corrector interior point method for solving linearly constrained convex programming is proposed.This method does not need any feasibilities of initial iterative point and is proved to be equivalent to a level 1 perturbed composite Newton method.Numerical experiments are made.
作者 梁昔明 卜彤
出处 《云南大学学报(自然科学版)》 CAS CSCD 2001年第3期169-172,共4页 Journal of Yunnan University(Natural Sciences Edition)
基金 国家自然科学基金资助项目 (6 99740 43) 国家博士点基金 (990 5 3317) 湖南省自然科学基金资助项目 (99JJY2 0 0 6 2 )
关键词 线性约束凸规划问题 预估校正内点法 数值试验 初始迭代点 1阶扰动复合牛顿法 linearly constrained convex programming predictor corrector interior point method numerical experiments
  • 相关文献

参考文献8

  • 1[1]FLETCHER R. Practical methods of optimization [M].2nd ed. New York: Wiley Pub, 1987.
  • 2[2]DUNN J C. On the convergence of projected gradient processes to singular critical points [J] .J Optim Theory Application, 1987, 55: 203-216.
  • 3[3]WRIGHT S J. An Interior-point algorithm for linearly constrained optimization [J]. SIAM J Optimization,1992, 2: 450-473.
  • 4[4]MEHROTRA S. On finding a vertex solution using interior-point methods [J]. Linear Algebra Application,1990, 152: 233-253.
  • 5[5]MEHROTRA S. On the implementation of a primal-dual interior point method [J]. SIAM J Optimization,1992, 2: 575-601.
  • 6[6]LUSTIG J, MAXSTEN R E, SHANNO D F. On the implementing Mehrotra' s predictor-corrector interiorpoint method for linear programming[J]. SIAM J Optimization, 1992, 2: 435-449.
  • 7[7]ORTEGA J M, RHEINBOLDT W C. Iterative solution of nonlinear equations in several variables [M]. New York:Academic Press, 1970.
  • 8[8]HOCK W, SCHITTKOWSKI K. Test examples for nonlinear programming codes [M]. Berlin: Springer,1981.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部