The infeasible combined homotopy method for a class of programming problems

Authors:
Jia-wei Tani;Jia Chen;Qing-huai Liu
Affiliations:
School of Basic Science, Changchun University of Technology, Changchun, China;School of Basic Science, Changchun University of Technology, Changchun, China;School of Basic Science, Changchun University of Technology, Changchun, China
Venue:
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Year:
2011

Citing 3
Cited 0

Numerical continuation methods: an introduction

Numerical continuation methods: an introduction
A combined homotopy interior point method for general nonlinear programming problems

Applied Mathematics and Computation
Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem

Nonlinear Analysis: Theory, Methods & Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.