A modified infeasible homotopy algorithm for computing fixed point in general non-convex set


Authors

Zhichuan Zhu - School of Statistics, Jilin University of Finance and Economics, Changchun, Jilin 130117, China. Ruifeng Wu - School of Applied Mathematics, Jilin University of Finance and Economics, Changchun, Jilin 130117, China. Yanchun Xing - School of Statistics, Jilin University of Finance and Economics, Changchun, Jilin 130117, China.


Abstract

In this paper, to find a fixed point of self-mapping in the general non-convex set with both equality constraints and inequality constraints, a modified infeasible homotopy for perturbing only inequality constraints is constructed and the global convergence of the smooth homotopy pathways is proved under some much weaker conditions. The advantage of the modified homotopy is that the initial point needs to be only in the shifted set with only inequality constraints, not necessarily, a feasible point in the original set, and hence it is more convenient to be implemented than the existing methods. The feasibility and effectiveness of the modified homotopy method is shown by some numerical tests.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Zhichuan Zhu, Ruifeng Wu, Yanchun Xing, A modified infeasible homotopy algorithm for computing fixed point in general non-convex set, Journal of Nonlinear Sciences and Applications, 10 (2017), no. 11, 5904--5913

AMA Style

Zhu Zhichuan, Wu Ruifeng, Xing Yanchun, A modified infeasible homotopy algorithm for computing fixed point in general non-convex set. J. Nonlinear Sci. Appl. (2017); 10(11):5904--5913

Chicago/Turabian Style

Zhu, Zhichuan, Wu, Ruifeng, Xing, Yanchun. "A modified infeasible homotopy algorithm for computing fixed point in general non-convex set." Journal of Nonlinear Sciences and Applications, 10, no. 11 (2017): 5904--5913


Keywords


MSC


References