法锥条件下非凸规划组合同伦算法的复杂性分析

摘要

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.%考虑非凸规划组合同伦算法的复杂性问题，假设目标函数在一个相当大的范围内有界，避免了可行域非凸情形下算法产生的迭代点列不在可行域内的情形，并证明了可行域满足法锥条件时非凸规划组合同伦算法的复杂性，得到了相应的估计结果。