点击次数：

论文类型：期刊论文

发表时间：2014-04-01

发表刊物：OPTIMIZATION

收录刊物：SCIE

卷号：63

期号：4

页面范围：585-600

ISSN号：0233-1934

关键字：homotopy method; global convergence; non-linear programming

摘要：In this article, a constraint shifting homotopy method (CSHM) is proposed for solving non-linear programming with both equality and inequality constraints. A new homotopy is constructed, and existence and global convergence of a homotopy path determined by it are proven. All problems that can be solved by the combined homotopy interior point method (CHIPM) can also be solved by the proposed method. In contrast to the combined homotopy infeasible interior point method (CHIIPM), it needs a weaker regularity condition. And the starting point in the proposed method is not necessarily a feasible point or an interior point, so it is more convenient to be implemented than CHIPM and CHIIPM. Numerical results show that the proposed algorithm is feasible and effective.