期刊文献+

约束优化一个线性逼近算法 被引量:1

Linear Approximation Algorithm for Constrained Optimization
下载PDF
导出
摘要 针对含有非线性不等式及线性等式与不等式约束的问题,给出了一种线性逼近算法。通过构造一个类似TV方法的子问题产生改进方向,利用Armijo线搜索产生步长,并在较弱的条件下得到了算法的全局收敛性。 A linear approximation algorithm for nonlinear inequality, linear equality and inequality constraints optimization is proposed. The improve direction is generated by a new sub-problem similar to a TV method, step length is produced by Armijo line search, and the global convergence is obtained under appropriate conditions,
作者 刘逸 陈巧芳
出处 《重庆理工大学学报(自然科学)》 CAS 2010年第5期115-118,共4页 Journal of Chongqing University of Technology:Natural Science
基金 广西自然科学基金资助项目(0832052)
关键词 约束优化 线性逼近 ARMIJO线搜索 全局收敛 constraints optimization linear approximation Armijo line search global convergence
  • 相关文献

参考文献9

  • 1Wiley J, Sons I. Nonlinear Programming[M]. [S. l. ] : [ s. n. ] ,2004:408 -431.
  • 2G. Zoutendijk. Methods of Feasible Directions [ M ]. Elsevier:Amsterdam, 1960.
  • 3Topkis V. The method of Topkis and Veinott[ M]. [ S. l, ]:[s.n. ], 1967.
  • 4Lawrence C T, Tits A L. A computationally efficient feasible sequential quadratic programming algorithm [J]. SIAM Journal on Optimization, 2001, 11:1092 -1118.
  • 5Yang Y F, Li D H, Qi L Q. A feasible sequential system oflinear equations method for inequality constrained optimization[J]. SIAM Journal on Optimization, 2003, 13 : 1222 - 1244.
  • 6Jian J B, Zheng H Y, Hu Q J. A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization [ J ]. Applied Mathematics and Computation, 2005, 168 : 1 - 28.
  • 7Jian J B, Zheng H Y, . Hu Q J. A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization [ J ]. Applied Mathematics and Computation, 2006, 182: 955 - 976.
  • 8Hua-qin Pan. A Strong Sub-Feasible Primal-Dual Interior Point Algorithm for Nonlinear Inequality Constrained Optimization [ D ]. Nanning: Guangxi University, 2007.
  • 9Jin-bao Jian, Xiao-yan Ke, Hai-yan Zheng. A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization [ J ]. Journal of Computational and Applied Mathematics, 2009,223 : 1013 - 1027.

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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