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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Smale, S.: A convergent process of price adjustment and global Newton method. J.Math. Econom. 3, 1–14 (1976)
Smale, S.: A convergent process of price adjustment and global Newton method. J.Math. Econom. 3, 1–14 (1976)
Chow, S.N., Mallet-Paret, J., Yorke, J.A.: Finding zeros of maps: homotopy methods that are constructive with probability one. Math. Comput. 32, 887–899 (1978)
Lin, Z.H., Li, Y., Feng, G.C.: A combined homotopy interior method for general nonlinear programming problem. Appl. Math. Comput. 80, 209–226 (1996)
Lin, Z.H., Zhu, D.L., Sheng, Z.P.: Finding a Minimal Efficient Solution of a Convex Multiobjective Program. Journal of oprimization Theory an Applications 118, 587–600 (2003)
Feng, G.C., Lin, Z.H., Bo, Y.: Existence of Interior Pathway to a Karush-Kuhn-Tucker Point of a Nonconvex Programming Problem. Nonlinear Analysis, Theory, Methods Applications 32(6), 761–768 (1998)
He, L., Dong, X.G., Tan, J.W., Liu, Q.H.: The Aggregate Homotopy Method for Multiobjective Max-min Problems. I.J. Image, Graphics and Signal Processing 2, 30–36 (2011)
Yu, B., Liu, Q.H., Feng, G.C.: A combined homotopy interior point method for nonconvex programming with pseudo cone condition. Northeast. Math. J. 16, 587–600 (2000)
Liu, Q.H., Yu, B., Feng, G.C.: A combined homotopy interior point method for nonconvex nonlinear programming problems under quasi normal cone condition, Acta. Math. Appl. Sinica. 26, 372–377 (2003)
Yang, Y., Lu, X., Liu, Q.: A Combined homotopy infeasible interior-point for convex nonlinear programming. Northeast Math. J. 22(2), 188–192 (2005)
Zhang, Z.S.: Introduction to Differential Topology. Bejing University Press, Beijing (2002)
Naber, G.L.: Topological Methods in Euclidean Spaces. Cambridge Unversity Press, London (1980)
Yu., B., Shang, Y.F.: Boundary Moving Combined Homotopy Method for Nonconvex Nonlinear Programming. Journal of Mathematical Research and Exposition (4), 831–834 (2006)
Wang, X.Y., Jiang, X.W., Liu, Q.H.: The Constraint Shifting Combined Homotopy Method For Bounded General Programming Problems. Journal of Information & Computational Science 7, 1–10 (2010)
Allgower, E.L., Georg, K.: Numerical Continuation Methods: An Introduction. Springer, Berlin (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tani, Jw., Chen, J., Liu, Qh. (2011). The Infeasible Combined Homotopy Method for a Class of Programming Problems. In: Liu, B., Chai, C. (eds) Information Computing and Applications. ICICA 2011. Lecture Notes in Computer Science, vol 7030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25255-6_96
Download citation
DOI: https://doi.org/10.1007/978-3-642-25255-6_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25254-9
Online ISBN: 978-3-642-25255-6
eBook Packages: Computer ScienceComputer Science (R0)