Non-convex regularization of bilinear and quadratic inverse problems by tensorial lifting

被引:3
|
作者
Beinert, Robert [1 ]
Bredies, Kristian [1 ]
机构
[1] Karl Franzens Univ Graz, Inst Mathemat & Wissensch Rechnen, Heinrichstr 36, A-8010 Graz, Austria
基金
奥地利科学基金会;
关键词
ill-posed inverse problems; bilinear and quadratic equations; non-convex Tikhonov regularization; convergence rates; deautoconvolution; CONVERGENCE-RATES; PHASE RETRIEVAL; AUTOCONVOLUTION; DEAUTOCONVOLUTION;
D O I
10.1088/1361-6420/aaea43
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Considering the question: how non-linear may a non-linear operator be in order to extend the linear regularization theory, we introduce the class of dilinear mappings, which covers linear, bilinear, and quadratic operators between Banach spaces. The corresponding dilinear inverse problems cover blind deconvolution, deautoconvolution, parallel imaging in MRI, and the phase retrieval problem. Based on the universal property of the tensor product, the central idea is here to lift the non-linear mappings to linear representatives on a suitable topological tensor space. At the same time, we extend the class of usually convex regularization functionals to the class of diconvex functionals, which are likewise defined by a tensorial lifting. Generalizing the concepts of subgradients and Bregman distances from convex analysis to the new framework, we analyse the novel class of dilinear inverse problems with nonconvex regularization terms and establish convergence rates with respect to a generalized Bregman distance under similar conditions than in the linear setting. Considering the deautoconvolution problem as specific application, we derive satisfiable source conditions and validate the theoretical convergence rates numerically.
引用
收藏
页数:40
相关论文
共 50 条
  • [41] A non-convex adaptive regularization approach to binary optimization
    Cerone, V
    Fosson, S. M.
    Regruto, D.
    [J]. 2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 3844 - 3849
  • [42] Sufficient Global Optimality Conditions for Non-convex Quadratic Minimization Problems With Box Constraints
    V. Jeyakumar
    A. M. Rubinov
    Z. Y. Wu
    [J]. Journal of Global Optimization, 2006, 36 : 471 - 481
  • [43] DUALITY FOR A CLASS OF NON-CONVEX PROBLEMS
    GONCALVES, AS
    [J]. OPERATIONS RESEARCH, 1975, 23 : B286 - B286
  • [44] Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
    Jeyakumar, V.
    Rubinov, A. M.
    Wu, Z. Y.
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2006, 36 (03) : 471 - 481
  • [45] CLASS OF NON-CONVEX OPTIMIZATION PROBLEMS
    HIRCHE, J
    TAN, HK
    [J]. ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1977, 57 (04): : 247 - 253
  • [46] Duality for non-convex variational problems
    Bouchitte, Guy
    Fragala, Ilaria
    [J]. COMPTES RENDUS MATHEMATIQUE, 2015, 353 (04) : 375 - 379
  • [47] A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
    Osmanpour, Naser
    Keyanpour, Mohammad
    [J]. OPTIMIZATION, 2022, 71 (14) : 4107 - 4123
  • [48] Pricing in non-convex markets with quadratic deliverability costs
    Kuang, Xiaolong
    Lamadrid, Alberto J.
    Zuluaga, Luis F.
    [J]. ENERGY ECONOMICS, 2019, 80 : 123 - 131
  • [49] Inverse Scale Space Iterations for Non-Convex Variational Problems: The Continuous and Discrete Case
    Bednarski, Danielle
    Lellmann, Jan
    [J]. JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2023, 65 (01) : 124 - 139
  • [50] Non-Convex and Convex Coupling Image Segmentation via TGpV Regularization and Thresholding
    Wu, Tingting
    Shao, Jinbo
    [J]. ADVANCES IN APPLIED MATHEMATICS AND MECHANICS, 2020, 12 (03) : 849 - 878