Data Processing with Combined Homotopy Methods for a Class of Nonconvex Optimization Problems

Article Preview

Abstract:

On the existing theoretical results, this paper studies the realization of combined homotopy methods on optimization problems in a specific class of nonconvex constrained region. Contraposing to this nonconvex constrained region, we give the structure method of the quasi-normal, prove that the chosen mappings on constrained grads are positive independent and the feasible region on SLM satisfies the quasi-normal cone condition. And we construct combined homotopy equation under the quasi-normal cone condition with numerical value and examples, and get a preferable result by data processing.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

403-406

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Allgower E L, Georg K. Numerical Continuation Methods: An Introduction. Berlin, New York: Springer-Verlag, (1990).

Google Scholar

[2] Garcia C B, Zangwill W I. Pathways to Solutions, Fixed Points and Equilibria. Englewood Cliffs, New Jersy: Prenice-hall, (1981).

Google Scholar

[3] Feng Guochen, Yu Bo. Combined Homotopy Interior Point Method for Nonlinear Programming Problems. Lecture Notes in Num. Appl. Anal, 1995, 14: 9-16.

Google Scholar

[4] McCormick G P. The Projective SUMT Method for Convex Programming. Mathermatics of Operations Research, 1989, 14: 203-223.

DOI: 10.1287/moor.14.2.203

Google Scholar

[5] Lin Zhenghua, The Interior Point Method to solve Mathematical Programming[D], The Doctorate Academic Dissertation of Jilin University, (1993).

Google Scholar

[6] Liu Qinghuai, The Combination Homotopy Interior Point Method to solve Nonconvex Programming[D], (1999).

Google Scholar