Minimization problems in $\ell^2$ for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted $\ell^1$ penalty term. The necessary and sufficient condition for optimality is shown to be slantly differentiable (Newton differentiable), hence a semismooth Newton method is applicable. Local superlinear convergence of this method is proved. Numerical examples are provided which show that our method compares favorably with existing approaches.
A dual based semismooth Newton method for a class of sparse Tikhonov regularization
众所周知,Tikhonov正则化是求解不适定问题最常用的方法之一。最广泛应用的方法之一是基于构建一个新的数据集,其样本量大于原始数据集。扩大的样本量可能会带来额外的计算困难。本文的目的是充分利用Tikhonov正则化,在不破坏数据集结构的情况下,发展一种基于对偶的半光滑牛顿(DSSN)方法。从理论的角度,我们将表明,\blue{the DSSN method is a globally convergent method with at least R-superlinear rate of convergence.}在数值计算方面,我们评估的DSSN方法的性能,通过解决一类稀疏Tikhonov正则化与高维数据集。
Preconditioning PDE-constrained optimization with $\rm L^1$-sparsity and control constraints
Università degli Studi di Firenze(佛罗伦萨大学);Università di Bologna(博洛尼亚大学);Max Planck Institute for Dynamics of Complex Technical Systems(马克斯·普朗克复杂技术系统动力学研究所)
A Semismooth Newton-Based Proximal Augmented Lagrangian Method for Joint Estimation of Multiple Gaussian Graphical Models with Clustered Structure
School of Mathematics and Statistics, Fuzhou University(福州大学数学与统计学院);Center for Applied Mathematics of Fujian Province, School of Mathematics and Statistics, Fuzhou University(福建省应用数学中心,福州大学数学与统计学院)
Functional error estimators for the adaptive discretization of inverse problems
Faculty of Mathematics, Universität Duisburg-Essen(杜伊斯堡-埃森大学数学学院);Institute of Mathematics, Alpen-Adria Universität Klagenfurt(克拉根福阿尔卑斯-亚得里亚大学数学研究所);Institute of Mathematics, Universität Würzburg(维尔茨堡大学数学研究所)