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

来源：

APPLIED MATHEMATICAL MODELLING | 2014年 / 38卷 / 23期

基金：

中国国家自然科学基金;

关键词：

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 条

[41] A PROJECTION ALGORITHM FOR NON-CONVEX SPLIT FEASIBILITY PROBLEM
Yang, Yang
Qu, Bia
Qiu, Ming
[J]. PACIFIC JOURNAL OF OPTIMIZATION, 2024, 20 (01): : 45 - 57
[42] A Global Linear and Local Superlinear (Quadratic) Inexact Non-Interior Continuation Method for Variational Inequalities Over General Closed Convex Sets
Le Thi Khanh Hien
Chek Beng Chua
[J]. Set-Valued and Variational Analysis, 2021, 29 : 109 - 144
[43] Quadratic convergence of a non-interior continuation method for second-order cone programming
Chi X.
Ku Z.
[J]. Journal of Convergence Information Technology, 2011, 6 (12) : 92 - 99
[44] A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
Dong, Li
Tang, Jingyong
Song, Xinyu
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2018, 95 (04) : 739 - 751
[45] An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
Aifan Ling
[J]. Numerical Algorithms, 2016, 73 : 219 - 244
[46] A NON-INTERIOR POINT HOMOTOPY-SMOOTHING METHODS FOR SOLVING EQUILIBRIUM PROBLEMS
Chen, Jia-Wei
Wan, Zhongping
Cho, Yeol Je
[J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2015, 16 (03) : 437 - 446
[47] ITERATIVE ALGORITHM FOR A CONVEX FEASIBILITY PROBLEM
Li, Yu
[J]. ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2010, 18 (01): : 205 - 218
[48] A non-interior path following method for convex quadratic programming problems with bound constraints
Xu, S
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2004, 27 (03) : 285 - 303
[49] Convergence theorems of subgradient extragradient algorithm for solving variational inequalities and a convex feasibility problem
Chidume C.E.
Nnakwe M.O.
[J]. Fixed Point Theory and Applications, 2018 (1)
[50] A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints
Song Xu
[J]. Computational Optimization and Applications, 2004, 27 : 285 - 303

← 1 2 3 4 5 →