期刊文献+

一类复杂非凸区域的拟法锥构造方法及其在非凸规划求解中的应用 被引量:4

A Method To Construct a Quasi-normal Cone for a Class of Complexity Nonconvex Sets and Its Applications in Solving Noncovex Programming
原文传递
导出
摘要 本文针对基于一般的凸集与"模型"的余集相交形成的一类满足拟法锥条件的复杂非凸区域,给出一种拟法锥的构造方法,在给定的拟法锥条件下,建立求解在该类非凸区域上规划问题的K-K-T点的组合同伦方程,并证明了该同伦内点法的整体收敛性,并通过数值例子证明算法是可行的和有效的. In this paper, we give a method to construct a quasi-normal cone for a class of non-convex sets based on a general convex set and the complement set of a wedge, which satisfies quasi-normal cone condition, and construct a Combined Homotopy Interior Point method (CHIP method) to solve the K-K-T point of Non-convex programming according to this quasi-normal set. We prove that PACHIP method has global convergence. It is proved that it is feasible and available by a numerical example.
出处 《应用数学学报》 CSCD 北大核心 2009年第3期400-412,共13页 Acta Mathematicae Applicatae Sinica
基金 国家自然科学基金(10771020)资助项目
关键词 非凸优化 正独立映射 拟法锥条件 组合同伦内点法 non-convex programming positive irrelative map quasi-normal cone condition combined homotopy interior point method
  • 相关文献

参考文献4

二级参考文献14

  • 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.

共引文献116

同被引文献17

引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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