A constraint shifting homotopy method for computing fixed points on nonconvex sets


Authors

Zhichuan Zhu - Faculty of Statistics, Jilin University of Finance and Economics, Changchun, Jilin 130117, China. - School of Mathematics and Statistics, Northeast Normal University, Changchun, Jilin 130024, China. Li Yang - School of Science, Dalian University of Technology, panjin 124221, China.


Abstract

In this paper, a constraint shifting homotopy method for solving fixed point problems on nonconvex sets is proposed and the existence and global convergence of the smooth homotopy pathways is proved under some mild conditions. Compared with the previous results, the newly proposed homotopy method requires that the initial point needs to be only in the shifted feasible set not necessarily in the original feasible set, which relaxes the condition that the initial point must be an interior feasible point. Some numerical examples are also given to show the feasibility and effectiveness of our method.


Share and Cite

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

Zhichuan Zhu, Li Yang, A constraint shifting homotopy method for computing fixed points on nonconvex sets, Journal of Nonlinear Sciences and Applications, 9 (2016), no. 6, 3850--3857

AMA Style

Zhu Zhichuan, Yang Li, A constraint shifting homotopy method for computing fixed points on nonconvex sets. J. Nonlinear Sci. Appl. (2016); 9(6):3850--3857

Chicago/Turabian Style

Zhu, Zhichuan, Yang, Li. "A constraint shifting homotopy method for computing fixed points on nonconvex sets." Journal of Nonlinear Sciences and Applications, 9, no. 6 (2016): 3850--3857


Keywords


MSC


References