| 法锥条件下非凸规划组合同伦算法的复杂性分析 |
| |
| 引用本文： | 刘巍,薛冬梅.法锥条件下非凸规划组合同伦算法的复杂性分析[J].吉林大学学报(理学版),2014,52(6):1203-1206. |
| |
| 作者姓名： | 刘巍 薛冬梅 |
| |
| 作者单位： | 1. 吉林化工学院 理学院, 吉林 吉林 132022； 2. 吉林大学 数学学院, 长春 130012 |
| |
| 摘 要： | 考虑非凸规划组合同伦算法的复杂性问题,假设目标函数在一个相当大的范围内有界,避免了可行域非凸情形下算法产生的迭代点列不在可行域内的情形,并证明了可行域满足法锥条件时非凸规划组合同伦算法的复杂性,得到了相应的估计结果.
|
| 关 键 词： | 非凸规划 同伦算法 复杂性分析 |
| 收稿时间： | 2014-07-11 |
Complexity Analysis for the Homotopy Method of Non-convex Programming under Normal Cone Conditions |
| |
| LIU Wei,XUE Dongmei.Complexity Analysis for the Homotopy Method of Non-convex Programming under Normal Cone Conditions[J].Journal of Jilin University: Sci Ed,2014,52(6):1203-1206. |
| |
| Authors: | LIU Wei XUE Dongmei |
| |
| Institution: | 1. School of Science, Jilin Institute of Chemical Teachnology, Jilin 132022, Jilin Province, China；2. College of Mathematics, Jilin University, Changchun 130012, China |
| |
| Abstract: | The complexity of the case of non convex programming problem homotopy algorithm was researched. We assumed the objective function to be bounded in a fairly large range so as to avoid the non convex case of feasible region. The algorithm generated iterate column is not in the feasible domain.We proved the complexity of non convex cone planning group homotopy algorithm when the feasible region satisfied the normal cone conditions and got the corresponding estimates. |
| |
| Keywords: | non-convex programming homotopy method complexity analysis |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
