期刊文献+

非凸多目标优化问题的连续同伦方法 被引量:1

HOMOTOPY CONTINUATION METHOD FOR NONCONVEX MULTIOBJECTIVE OPTIMIZATION PROBLEM
在线阅读 下载PDF
导出
摘要 考虑具有等式和不等式约束的非凸多目标优化问题(MOP).在某些基本假设条件下,构造了一个新的连续同伦映射,证明了由该映射可以得到一个有界光滑的同伦路径,且收敛到多目标优化问题的KKT系统的解.同时又保证了该算法的全局收敛性及数值结果的有效性. In this paper, we considered noneonvex multiobjeetive optimization problem (MOP) with equality and inequality constraints. Under the suitable assumptions, we construct a new homotopy continuation mapping, and obtain a smooth bounded homotopy path which converges to a solution of KKT system of MOP. We also proved the global convergence of algorithm and give a numerical result.
作者 邢巍 宋文
机构地区 哈尔滨师范大学
出处 《哈尔滨师范大学自然科学学报》 CAS 2008年第5期1-4,共4页 Natural Science Journal of Harbin Normal University
基金 黑龙江省自然科学基金项目(No.A200607)
关键词 多目标优化 连续同伦方法 全局收敛 Muhiobjective problem Homotopy continuation method Global convergence
  • 相关文献

参考文献4

  • 1M. L. Su,X. R. Lv andZ. X. Liu. Solving a class of nonlinear programming problems via homotopy continuation method. Northeast Math. J. (accpteed) ,2007.
  • 2C. B. Garcia and W. I. Zangwill. Pathways to solutions, fixed points and equilibria. Englewood Cliffs, NJ : Prentice - Hall, 1981:475 - 495.
  • 3刘庆怀,于波,冯果忱.基于拟法锥条件的非凸非线性规划问题的同伦内点法[J].应用数学学报,2003,26(2):372-377. 被引量:18
  • 4W. Song and G. M. Yao. Homotopy method for a general multiobjective programming problem. J. Optim Theory Appl. ( accpteed) ,2008.

二级参考文献10

  • 1Garcia C B, Zangwill W I. Pathways to Solutions Fixed Points and Equilibria. N J: Englewood Cliffs,Prentice-Hall, 1981.
  • 2Allgower, E L, Georg K. Numerical Continuation Method: an Introduction. Berlin, New York:Springer-Verlag, 1990.
  • 3Kojima M, Mizuno S, Yoshise A. A Primal-dual Interior Point Algorithm for Linear Programming.In: Progress in Mathematical Programming, Interior Point and Related Methods, ed. Megiddo N.New York: Springer-Verlag, 1988, 29-47.
  • 4Adler I, Resende M G C, Veiga G, Karmarkar N. An Implementation of Karmarkar's Algorithm for Linear Programming Problems. Mathematical Programming, 1989, 44:287-335.
  • 5Lin Z H, Yu B, Feng G C. A Combined Homotopy Interior Point Method for Convex Programming Problem. Appl. Math. Comput., 1997, 84:193-211.
  • 6Monteiro R D C, Adier I. Interior Path Following Primal-dual Algorithms I: Linear Programming.Mathematical Programming, 1989, 44:27-41.
  • 7Wang Y, Feng G C, Liu T Z. Interior Point Algorithms for Convex Nonlinear Programming Problems.Numerical Mathematics, J. Chinese Universities, 1992, 1: 1-8.
  • 8Zhu J A. A Path Following Algorithms for a Class of Convex Programming Problems. ZOR-Methods and Models of Operations Research, 1992, 36:359-337.
  • 9Feng G C, Lin Z H, Yu B. Existence of Interior Pathway to a Karush-Kuhn-Tucker Point of a Nonconvex Programming Problem. Nonlinear Analysis, Theory, Methods & Applications, 1998, 32(6):761-768.
  • 10Yu B, Feng G C. Globally Convergent Interior Path Following Methods for Nonlinear Programming and Brouwer Fixed Point Problems. In: Advances in Nonlinear Programming, ed. Yuan Yaxiang,Netherlands: Kluwer Academic Publisher, 1998, 325-342.

共引文献17

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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