期刊文献+

内点算法的若干基本框架及其发展 被引量:1

Interior point algorithms-fundatmental frames and its extension
在线阅读 下载PDF
导出
摘要 近十几年来内点算法已经成为数学规划中非常活跃的研究方向,其收敛性和计算速度均优于单纯形算法.本文对此方向目前形成的三类主要算法:势函数投影算法,仿射尺度算法,路径跟踪算法的基本框架以及成为多项式算法的机理给予分析和阐述,并指出它们在数学规划和解决实际问题方面的扩展. Interior point algorithms theory has been a very. active research direction in mathematical programming, which not only has a better polynomial complexity but also is a challenging competitor of the simplex method in practice. In this paper, several kind of important interior point algorithms (potential reduction algorithm, affine scaling algorithm, target-following algorithm) have been surveyed. The mainframe of the algorithm and its extension are analysed in detail.
作者 王雪
出处 《泰山学院学报》 2007年第3期13-16,共4页 Journal of Taishan University
关键词 内点算法 线性规划 数学规划 interior-point algorithm linear programming mathematical programming
  • 相关文献

参考文献3

  • 1梁昔明.求解凸二次规划问题的势下降内点算法[J].高等学校计算数学学报,2002,24(1):81-86. 被引量:13
  • 2Robert J. Vanderbei,David F. Shanno. An Interior-Point Algorithm for Nonconvex Nonlinear Programming[J] 1999,Computational Optimization and Applications(1-3):231~252
  • 3Shinji Mizuno,Atsushi Nagasawa. A primal—dual affine-scaling potential-reduction algorithm for linear programming[J] 1993,Mathematical Programming(1-3):119~131

二级参考文献12

  • 1[1]Lucia, A. and Xu, J.. Chemical process optimization using Newton-like methods. Computers chem. Engng. , 1990, 14(2):119-138
  • 2[2]Fletcher, R.. Practical methods of optimization. 2nd end.. New York, Wiley Pub. , 1987
  • 3[3]Lucia, A. , Xu, J. and Couto, G. C. D'. . Sparse quadratic programming in chemical process optimization. Ann. Oper. Res. , 1993, 42(1):55-83
  • 4[4]Vasantharajan, S. , Viswanathan, J. and Biegler, L.T.. Reduced successive quadratic programming implementation for large-scale optimization problems with smaller degrees of freedom. Computers chem. Engng. , 1990,14 (8): 907- 915
  • 5[5]Kozlov, M.K. , Tarasov, S.P. and Khachiyan, L.G. , Polynomial solvability of convex quadratic programming. Soviet Mathematics Doklady, 1979,20(8):1108-1111
  • 6[6]Kappor, S. and Vaidya, P.M.. Fast algorithms for convex quadratic programming and multicommodity flows. Proceedings of the 18th Annual ACM Symposium on Theory of Computing, California, May, 1986,147- 159
  • 7[7]Ye, Y. and Tse, E.. A polynomial algorithm for convex programmin. Working Paper, Department of Enginering-Economic Systems, Stanford University, Stanford, CA, 1986
  • 8[8]Monteiro, R. D.C. and Adler, I. , Interior path following primal-dual algorithms. Part I : convex quadratic programming. Math. Programming, 1989,44 (1) : 43- 66
  • 9[9]McCormick, G. P.. Nonlinear programming: theory, algorithms and applications. New York:John Wileg & Sons Inc. , 1983
  • 10[10]Monteiro, R. D. C. . A globally convergent primal-dual interior point algorithm for convex programming. Math. Programming, 1994, 64(1) : 123- 147

共引文献12

同被引文献6

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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