A GLOBALLY CONVERGENT METHOD FOR COMPUTING THE FIXED POINT OF SELF-MAPPING ON GENERAL NONCONVEX SET

被引：0

作者：

Zhu, Zhichuan ^{[1
,2
]}

Zhou, Zhengyong ^{[3
]}

Liou, Yeong-Cheng ^{[4
,5
,6
]}

Yao, Yonghong ^{[7
]}

Xing, Yanchun ^{[1
,2
]}

机构：

[1] Jilin Univ Finance & Econ, Fac Stat, Changchun 130117, Jilin, Peoples R China

[2] North East Normal Univ, Sch Math & Stat, Changchun 130024, Jilin, Peoples R China

[3] Shanxi Normal Univ, Sch Math & Comp Sci, Linfen 041004, Shanxi, Peoples R China

[4] Kaohsiung Med Univ, Dept Healthcare Adm & Med Informat, Ctr Big Data Analyt & Intelligent Healthcare, Kaohsiung 807, Taiwan

[5] Kaohsiung Med Univ, Res Ctr Nonlinear Anal & Optimizat, Kaohsiung 807, Taiwan

[6] Kaohsiung Med Univ Hosp, Dept Med Res, Kaohsiung 807, Taiwan

[7] Tianjin Polytech Univ, Dept Math, Tianjin 300387, Peoples R China

来源：

JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2017年 / 18卷 / 06期

关键词：

Homotopy method; fixed point; nonconvex sets; shifted feasible set; HOMOTOPY METHOD; ALGORITHM;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, to compute the fixed point of self-mapping on general nonconvex sets with both inequality and equality constraints, the equality constraints are turned into some inequality constraints and a feasible set swelling homotopy is constructed. Under some mild conditions, the existence and global convergence of the smooth homotopy pathways is also proved. Compared with the previous results, the initial point is not needed to be a feasible interior point of the original feasible set, and can be chosen freely in a bounded ball region of the shifted feasible set. Some numerical examples are also given to show the feasibility and effectiveness of the homotopy method.

引用

页码：1067 / 1078

页数：12

共 50 条

[41] Method for Computing Distance the Between Point and Convex Set
Yong Longquan
PROCEEDINGS OF THE 2010 INTERNATIONAL CONFERENCE ON APPLICATION OF MATHEMATICS AND PHYSICS, VOL 2: ADVANCES ON APPLIED MATHEMATICS AND COMPUTATION MATHEMATICS, 2010, : 199 - 203
[42] A globally convergent non-interior point homotopy method for solving variational inequalities
Shang, Yufeng
Xu, Qing
Yu, Bo
OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (06): : 933 - 943
[43] A contractive fixed point free mapping on a weakly compact convex set
Burns, Jared
Lennard, Chris
Sivek, Jeromy
STUDIA MATHEMATICA, 2014, 223 (03) : 275 - 283
[44] Fixed point theorems for the Ψ-set contraction mapping on almost convex sets
Chen, Chi-Ming
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2009, 71 (7-8) : 2600 - 2605
[45] A Globally Convergent Interval Method for Computing and Bounding Multiple Roots of a Once Continuously Differentiable Function
Bin Mohd, Ismail
Dasril, Yosza
4TH INNOVATION AND ANALYTICS CONFERENCE & EXHIBITION (IACE 2019), 2019, 2138
[46] An algorithm for finding a common point of the solution set of a variational inequality and the fixed point set of a Bregman relatively nonexpansive mapping
Zegeye, H.
Shahzad, N.
APPLIED MATHEMATICS AND COMPUTATION, 2014, 248 : 225 - 234
[47] Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping
H. Iiduka
Journal of Optimization Theory and Applications, 2009, 140 : 463 - 475
[48] GO-APSR: A Globally Optimal Affine Point Set Registration Method
Li, Xuechen
Liu, Yinlong
Wang, Manning
Song, Zhijian
IEEE ACCESS, 2019, 7 : 137232 - 137240
[49] Hybrid Conjugate Gradient Method for a Convex Optimization Problem over the Fixed-Point Set of a Nonexpansive Mapping
Iiduka, H.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2009, 140 (03) : 463 - 475
[50] Simple method of computing a function in fixed-point arithmetic
Deo, SS
Hari, KVS
ELECTRONICS LETTERS, 1997, 33 (23) : 1931 - 1932

← 1 2 3 4 5 →