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 条
  • [1] Exploring the convex transformations for solving non-convex bilinear integer problems
    Harjunkoski, I
    Pörn, R
    Westerlund, T
    [J]. COMPUTERS & CHEMICAL ENGINEERING, 1999, 23 : S471 - S474
  • [2] Robust PCA via non-convex half-quadratic regularization
    Wang, Zhi-Yong
    Li, Xiao Peng
    So, Hing Cheung
    Liu, Zhaofeng
    [J]. SIGNAL PROCESSING, 2023, 204
  • [3] A Study on GMLVQ Convex and Non-convex Regularization
    Nova, David
    Estevez, Pablo A.
    [J]. ADVANCES IN SELF-ORGANIZING MAPS AND LEARNING VECTOR QUANTIZATION, WSOM 2016, 2016, 428 : 305 - 314
  • [4] Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
    Jeyakumar, V.
    Rubinov, A. M.
    Wu, Z. Y.
    [J]. MATHEMATICAL PROGRAMMING, 2007, 110 (03) : 521 - 541
  • [5] Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
    V. Jeyakumar
    A. M. Rubinov
    Z. Y. Wu
    [J]. Mathematical Programming, 2007, 110 : 521 - 541
  • [6] Positive definite separable quadratic programs for non-convex problems
    Groenwold, Albert A.
    [J]. STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2012, 46 (06) : 795 - 802
  • [7] Branch and Bound Method to Resolve the Non-convex Quadratic Problems
    Benacer, R.
    Gasmi, Boutheina
    [J]. INTELLIGENT MATHEMATICS II: APPLIED MATHEMATICS AND APPROXIMATION THEORY, 2016, 441 : 105 - 117
  • [8] A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
    Wu, Huizhuo
    Zhang, KeCun
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 197 (02) : 810 - 818
  • [9] Positive definite separable quadratic programs for non-convex problems
    Albert A. Groenwold
    [J]. Structural and Multidisciplinary Optimization, 2012, 46 : 795 - 802
  • [10] Global optimization of general non-convex problems with intermediate bilinear substructures
    Zorn, Keith
    Sahinidis, Nikolaos V.
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2014, 29 (03): : 442 - 462