A variable projection method for large-scale inverse problems with l1 regularization

被引:2
|
作者
Chung, Matthias [1 ]
Renaut, Rosemary A. [2 ]
机构
[1] Emory Univ, Dept Math, Atlanta, GA 30322 USA
[2] Arizona State Univ, Sch Math & Stat Sci, Tempe, AZ USA
基金
美国国家科学基金会;
关键词
Variable projection; Alternating Direction Method of Multipliers (ADMM); Regularization; Inverse problems; chi(2) test; NONLINEAR LEAST-SQUARES; MINIMIZATION; ALGORITHM; LASSO; SHRINKAGE; SELECTION; FREEDOM;
D O I
10.1016/j.apnum.2023.06.015
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Inference by means of mathematical modeling from a collection of observations remains a crucial tool for scientific discovery and is ubiquitous in application areas such as signal compression, imaging restoration, and supervised machine learning. With ever-increasing model complexities and larger data sets, new specially designed methods are urgently needed to recover meaningful quantities of interest. We consider the broad spectrum of linear inverse problems where the aim is to reconstruct quantities with a sparse representation on some vector space. We provide a new variable projection augmented Lagrangian algorithm to solve the underlying l(1) regularized inverse problem that is both efficient and effective. We present the proof of convergence for an algorithm using an inexact step for the projected problem at each iteration. The performance and convergence properties for various imaging problems are investigated. The efficiency of the algorithm makes it feasible to automatically find the regularization parameter, here illustrated using an argument based on the degrees of freedom of the objective function equipped with a bisection algorithm for root-finding. (c) 2023 IMACS. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:297 / 318
页数:22
相关论文
共 50 条
  • [41] On the choice of subspace for large-scale Tikhonov regularization problems in general form
    Huang, Guangxin
    Reichel, Lothar
    Yin, Feng
    NUMERICAL ALGORITHMS, 2019, 81 (01) : 33 - 55
  • [42] On the choice of subspace for large-scale Tikhonov regularization problems in general form
    Guangxin Huang
    Lothar Reichel
    Feng Yin
    Numerical Algorithms, 2019, 81 : 33 - 55
  • [43] Efficient Parallel Streaming Algorithms for large-scale Inverse Problems
    Sundar, Hari
    2017 IEEE HIGH PERFORMANCE EXTREME COMPUTING CONFERENCE (HPEC), 2017,
  • [44] An autoencoder compression approach for accelerating large-scale inverse problems
    Wittmer, Jonathan
    Badger, Jacob
    Sundar, Hari
    Bui-Thanh, Tan
    INVERSE PROBLEMS, 2023, 39 (11)
  • [45] PRACTICAL STRATEGIES FOR THE SOLUTION OF LARGE-SCALE ELECTROMAGNETIC INVERSE PROBLEMS
    OLDENBURG, DW
    RADIO SCIENCE, 1994, 29 (04) : 1081 - 1099
  • [47] Method of descriptive regularization for the inverse problems
    Morozov, V.A.
    Gol'dman, N.L.
    Malyshev, V.A.
    Inzhenerno-Fizicheskii Zhurnal, 1993, 65 (06): : 695 - 702
  • [48] AN l1 - lp DC REGULARIZATION METHOD FOR COMPRESSED SENSING
    Cao, Wenhe
    Ku, Hong-Kun
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2020, 21 (09) : 1889 - 1901
  • [49] A STOCHASTIC NEWTON MCMC METHOD FOR LARGE-SCALE STATISTICAL INVERSE PROBLEMS WITH APPLICATION TO SEISMIC INVERSION
    Martin, James
    Wilcox, Lucas C.
    Burstedde, Carsten
    Ghattas, Omar
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (03): : A1460 - A1487
  • [50] The Group-Lasso: l1,∞ Regularization versus l1,2 Regularization
    Vogt, Julia E.
    Roth, Volker
    PATTERN RECOGNITION, 2010, 6376 : 252 - 261