Iterative algorithm for solving a class of convex feasibility problem

被引：2
|
作者：
Li, Chunmei [1 ]
Duan, Xuefeng [2 ]
Lu, Linzhang [1 ]
Wang, Qingwen [3 ]
Shen, Shuqian [4 ]
机构：
[1] Guizhou Normal Univ, Sch Math Sci, Guiyang 550001, Guizhou, Peoples R China
[2] Guilin Univ Elect Technol, Coll Math & Computat Sci, Guangxi Key Lab Cryptog & Informat Secur, Key Lab Data Anal & Computat,Guangxi Coll & Univ, Guilin 541004, Peoples R China
[3] Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
[4] China Univ Petr, Coll Sci, Qingdao 257061, Peoples R China
来源：
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 2019年 / 352卷
基金：
中国国家自然科学基金;
关键词：
Convex feasibility problem; Projection formula; Relaxed alternating projection algorithm; Quantum computation; SUBGRADIENT PROJECTION ALGORITHMS;
D O I：
10.1016/j.cam.2018.11.029
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we consider a class of convex feasibility problem, which arises in quantum computation. Based on the matrix equation theory, the feasible sets are characterized by exploiting the special structure of the linear constraints, and its analytic expression is given. By making use of the nice structure properties and the KKT condition, we derive the projection formulas of a matrix onto the feasible sets. The relaxed alternating projection method is designed to solve the convex feasibility problem. Numerical experiments show that the new method is feasible and effective. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码：352 / 367
页数：16
相关论文
共 50 条
  • [1] ITERATIVE ALGORITHM FOR A CONVEX FEASIBILITY PROBLEM
    Li, Yu
    [J]. ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2010, 18 (01): : 205 - 218
  • [2] Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
    Chang, Shih-sen
    Kim, Jong Kyu
    Wang, Xiong Rui
    [J]. JOURNAL OF INEQUALITIES AND APPLICATIONS, 2010,
  • [3] Modified Block Iterative Algorithm for Solving Convex Feasibility Problems in Banach Spaces
    Shih-sen Chang
    JongKyu Kim
    XiongRui Wang
    [J]. Journal of Inequalities and Applications, 2010
  • [4] A non-interior continuation algorithm for solving the convex feasibility problem
    Lu, Nan
    Ma, Feng
    Liu, Sanyang
    [J]. APPLIED MATHEMATICAL MODELLING, 2014, 38 (23) : 5421 - 5430
  • [5] MULTISTEP GENERALIZED VISCOSITY ITERATIVE ALGORITHM FOR SOLVING CONVEX FEASIBILITY PROBLEMS IN BANACH SPACES
    Hussain, Nawab
    Nandal, Ashish
    Kumar, Vivek
    Chugh, Renu
    [J]. JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2020, 21 (03) : 587 - 603
  • [6] A new three-step iterative algorithm for solving the split feasibility problem
    Feng, Meiling
    Shi, Luoyi
    Chen, Rudong
    [J]. UPB Scientific Bulletin, Series C: Electrical Engineering and Computer Science, 2019, 81 (01): : 93 - 102
  • [7] A NEW THREE-STEP ITERATIVE ALGORITHM FOR SOLVING THE SPLIT FEASIBILITY PROBLEM
    Feng, Meiling
    Shi, Luoyi
    Chen, Rudong
    [J]. UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN-SERIES A-APPLIED MATHEMATICS AND PHYSICS, 2019, 81 (01): : 93 - 102
  • [8] A new three-step iterative algorithm for solving the split feasibility problem
    Department of Mathematics, Tianjin Polytechnic University, Tianjin
    300387, China
    [J]. UPB Sci Bull Ser A, 2019, 1 (93-102): : 93 - 102
  • [9] ITERATIVE ALGORITHM FOR SOLVING A CLASS OF INEQUATIONS
    SONNTAG, Y
    [J]. COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1976, 282 (05): : 293 - 295
  • [10] Iterative Method for Solving the Linear Feasibility Problem
    R. Dudek
    [J]. Journal of Optimization Theory and Applications, 2007, 132 : 401 - 410
12345