The Infeasible Combined Homotopy Method for a Class of Programming Problems

被引：0

作者：

Tani, Jia-wei ^{[1
]}

Chen, Jia ^{[1
]}

Liu, Qing-huai ^{[1
]}

机构：

[1] Changchun Univ Technol, Sch Basic Sci, Changchun 130012, Peoples R China

来源：

INFORMATION COMPUTING AND APPLICATIONS | 2011年 / 7030卷

关键词：

Infeasible point; Combined Homotopy; Nonlinear Programming; POINT;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, a class of nonconvex programming problems with inequality constraint functions was studied, under the conditions that the boundary is regular and the feasible set is connected and bounded. At first, the infeasible constraint functions were constructed. Then, the infeasible combined homotopy equation was constructed to solve this problem. At last the existence of a smooth homotopy path from any initial point to the solution of the problem was established and the convergence of the method is proved.

引用

页码：758 / 764

页数：7

共 14 条

[1]

Allgower E. L., 1990, Numerical continuation methods, an introduction

[2]

CHOW SN, 1978, MATH COMPUT, V32, P887, DOI 10.1090/S0025-5718-1978-0492046-9

[3] Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem [J].

Feng, GC ;

Lin, ZH ;

Yu, B .

NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 1998, 32 (06) :761-768

[4]

HE L, 2011, IMAGE GRAPHICS SIGNA, V2, P30

[5]

He L., 2011, NE MATH J, V2, P30

[6] Finding a minimal efficient solution of a convex multiobjective program [J].

Lin, ZH ;

Zhu, DL ;

Sheng, ZP .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2003, 118 (03) :587-600

[7]

Lin ZH, 1996, APPL MATH COMPUT, V80, P209, DOI 10.1016/0096-3003(95)00295-2

[8]

Liu Q.H., 2003, NE MATH J, V26, P372

[9]

Naber G., 1980, Topological methods in Euclidean spaces

[10]

Naber G.L., 1980, J MATH RES EXPOSITIO

← 1 2 →