期刊文献+

一个改进的拟可行内点法 被引量:1

An Improved Quasi-Feasible Interior Point Method
下载PDF
导出
摘要 使用拟可行内点法研究一般的光滑约束最优化问题.在算法中改进了拟可行内点法中的值函数,使用指数形式的更一般函数,用此值函数证明了可行性问题的一阶最优性点的存在性,并通过对内部算法及外部算法的讨论得到了算法的收敛性定理.算例结果表明,指数的变化对迭代次数、拉格朗日乘子的取值及初值的选取都有较大影响,通过合适的取值可使算法具有更好的收敛性. The authors used quasi-feasible interior point method to solve general smooth constraint optimization problems. We improved the merit function in quasi-feasible interior point method and used the exponential function that is the more general function to prove the existence ot one order optimality point m feasible problem. We discussed the inner and outer algorithms and made the convergence theorem. The example shows that the exponential change has tremendous influences on iterative number, Lagrange multiplier value and initial value. An appropriate value selected can make the algorithm have a good convergence property.
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2010年第2期193-200,共8页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:10771020)
关键词 内点法 收敛性 约束规划 interior-point method convergence constrained programming
  • 相关文献

参考文献10

  • 1Karmarkar N. A New Polynomial-Time Algorithm for Linear Programming [ J]. Combinatorica, 1984, 4 (4) : 374-395.
  • 2Renegar J. A Polynomial-Time Algorithm, Based on Newton' s Method, for Linear Programming [ J ]. Mathematical Programming, 1988, 40( 1 ) : 59-93.
  • 3Tits A L, Wachter A, Bakhitiari S, et al. A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties [ J ]. SIAM Journal on Optimization, 2004, 14 (1) : 173-199.
  • 4Argaez M, Tapia R A. On the Global Convergence of a Modified Augmented Lagrangian Linesearch Interior-Point Newton Method for Nonlinear Programming [ J ]. Journal of Optimization Theory and Applications, 2002, 114 (1) : 1-25.
  • 5Akrotirianakis I, Rustem B. Globally Convergent Interior-Point Algorithm for Nonlinear Programming [ J ]. Journal of Optimization Theory and Applications, 2005, 125(3) : 497-521.
  • 6Yamashita H, Yabe H. An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization [ J ]. SIAM Journal on Optimization, 2003, 14 (2) : 479-499.
  • 7Yamashita H, Yabe H, Tanabe T. A Globally and Superlinearly Convergent Primal-Dual Interior Point Trust Region Method for Large Scale Constrained Optimization [ J ]. Mathematical Programming, 2005, 102 (1) : 111-151.
  • 8姜志侠,李军,张珊.一个改进的原始对偶内点方法[J].吉林大学学报(理学版),2009,47(4):677-682. 被引量:3
  • 9Megiddo N. Pathways to the Optimal Set in Linear Programming [ C ]//Progress in Mathematical Programming Interior- Point and Related Methods. New York: Springer, 1989: 131-158.
  • 10Chen L, Goldfarb D. Interior-Point l2-Penalty Methods for Nonlinear Programming with Strong Global Convergence Properties [J]. Mathematical Programming, 2006, 108(1):1-36.

二级参考文献8

  • 1L. Chen,D. Goldfarb. Interior-point ? 2-penalty methods for nonlinear programming with strong global convergence properties[J] 2006,Mathematical Programming(1):1~36
  • 2I. Akrotirianakis,B. Rustem. Globally Convergent Interior-Point Algorithm for Nonlinear Programming[J] 2005,Journal of Optimization Theory and Applications(3):497~521
  • 3Hande Y. Benson,David F. Shanno,Robert J. Vanderbei. Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing[J] 2004,Mathematical Programming(1):35~48
  • 4M. Argáez,R. A. Tapia. On the Global Convergence of a Modified Augmented Lagrangian Linesearch Interior-Point Newton Method for Nonlinear Programming[J] 2002,Journal of Optimization Theory and Applications(1):1~25
  • 5Robert J. Vanderbei,David F. Shanno. An Interior-Point Algorithm for Nonconvex Nonlinear Programming[J] 1999,Computational Optimization and Applications(1-3):231~252
  • 6James Renegar. A polynomial-time algorithm, based on Newton’s method, for linear programming[J] 1988,Mathematical Programming(1-3):59~93
  • 7N. Karmarkar. A new polynomial-time algorithm for linear programming[J] 1984,Combinatorica(4):373~395
  • 8D. Q. Mayne,E. Polak. Feasible directions algorithms for optimization problems with equality and inequality constraints[J] 1976,Mathematical Programming(1):67~80

共引文献2

同被引文献6

  • 1Nikkar A, Mighani M. Application of He's Variational Iteration Method for Solving Seventh-Order Differential Equations [J]. American Journal of Computational and Applied Mathematics, 2012, 2(1): 37-40.
  • 2LU Junfeng. Variational Iteration Method for Solving a Nonlinear System of Second-Order Boundary Value Problems [J]. Computers & Mathematics with Applications, 2007, 54(7/8): 1133-1138.
  • 3WU Guocheng, Baleanu D. New Applications of the Variational Iteration Method from Differential Equations to q-Fractional Difference Equations [J/OL]. Advances in Difference Equations, 2013-01-24. http://www. advancesindifferenceequations, com/content/2013/1/21.
  • 4SU Chelin, Judd K L. Constrained Optimization Approaches to Estimation of Structural Models [J]. Econometriea, 2012, 80(5):2213-2230.
  • 5Okamoto Takashi, Hirata Hironori. Constrained Optimization Using a Muhipoint Type Chaotic Lagrangian Method with a Coupling Structure [J]. Engineering Optimization, 2013, 45(3).. 311-336.
  • 6房明磊,朱志斌,张聪,陈凤华.非线性优化的广义投影变尺度算法及超线性收敛性[J].吉林大学学报(理学版),2011,49(3):373-380. 被引量:1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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