J4

• • 上一篇    下一篇

解序列极大极小问题的凝聚同伦方法

刘国新1, 冯果忱1, 于 波2   

  1. 1. 吉林大学数学学院, 长春 130012; 2. 大连理工大学应用数学系, 大连 116024)
  • 收稿日期:2003-03-14 修回日期:1900-01-01 出版日期:2003-04-26 发布日期:2003-04-26
  • 通讯作者: 刘国新

Aggregate Homotopy Method for Sequential Max-Min Problems

LIU Guo-xin1, Feng Guo-chen1, YU Bo2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China; 2. Department of Applied Mathematics, Dalian University of Science and Technology, Dalian 116024, China
  • Received:2003-03-14 Revised:1900-01-01 Online:2003-04-26 Published:2003-04-26
  • Contact: LIU Guo-xin

摘要: 研究序列极大极小问题. 得到了一阶必要条件的具体表达式, 即所谓广义K-K-T方程. 利用多次凝聚技巧和同伦方法, 构造地证明了K-K-T方程解的存在性, 同时在一定的条件下, 还证明了对几乎所有的初值, 同伦路径以广义K-K-T方程解为极限点.

关键词: 非光滑规划, 序列极大极小, 凝聚函数, 同伦方法

Abstract: In this paper, the sequential max-min problem is considered. At first, an explicit first order condition, called the generalized K-K -T condition, is given and then, by using the secondary aggregate function technique and the homotopy method, a smooth path following method is given to find a generalized K-K-T point.

Key words: nonsmooth programming, sequential max-min, aggregate function, homoto py method

中图分类号: 

  • O221.2