A non-interior continuation algorithm for solving the convex feasibility problem

被引:3
|
作者
Lu, Nan [1 ]
Ma, Feng [1 ]
Liu, Sanyang [1 ]
机构
[1] Xidian Univ, Sch Math & Stat, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Convex feasibility problem; Non-interior continuation algorithm; Global linear convergence; Local quadratic convergence; SMOOTHING-TYPE ALGORITHM; PROJECTION METHODS; CONVERGENCE; SYSTEM;
D O I
10.1016/j.apm.2014.04.030
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a specific class of convex feasibility problems are considered and a non-interior continuation algorithm based on a smoothing function to solve this class of problems is introduced. The proposed algorithm solves at most one system of linear equations at each iteration. Under some weak assumptions, we show that the algorithm is globally linearly and locally quadratically convergent. Preliminary numerical results are also reported, which verify the favorable theoretical properties of the proposed algorithm. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:5421 / 5430
页数:10
相关论文
共 50 条