Global convergence of damped semismooth Newton methods for ℓ1 Tikhonov regularization

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Inverse Problems

• Publication date

  2015-01-30

• Fields of study

  Mathematics, Physics

• Identifiers
  DOI 10.1088/0266-5611/31/2/025005
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Semismooth Newton Method with Multidimensional Filter Globalization for l1-Optimization

  2014cited by this paper
• FOUR KINDS OF DIFFERENTIABLE MAPS

  2013cited by this paper
• FOUR KINDS OF DIFFERENTIABLE MAPS

  2013cited by this paper
• Introduction to Piecewise Differentiable Equations

  2012cited by this paper
• Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing

  2011cited by this paper
• Newton Methods for Nonlinear Problems: Affine Invariance and Adaptive Algorithms

  2011cited by this paper
• Morozov's discrepancy principle for Tikhonov-type functionals with nonlinear operators

  2010cited by this paper
• The Split Bregman Method for L1-Regularized Problems

  2009cited by this paper
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

  2009cited by this paper
• On a semi-smooth Newton method and its globalization

  2009influential reference
• A generalized conditional gradient method and its connection to an iterative shrinkage method

  2009cited by this paper
• Morozov's discrepancy principle and Tikhonov-type functionals

  2008cited by this paper
• Linear Convergence of Iterative Soft-Thresholding

  2007cited by this paper
• A semismooth Newton method for Tikhonov functionals with sparsity constraints

  2007cited by this paper
• On the performance of algorithms for the minimization of ℓ1-penalized functionals

  2007cited by this paper
• Signal Recovery by Proximal Forward-Backward Splitting

  2005cited by this paper
• On Concepts of Directional Differentiability

  2004cited by this paper
• Newton Methods for Nonlinear Problems

  2004cited by this paper
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

  2003influential reference
• Finite-Dimensional Variational Inequalities and Complementarity Problems

  2003cited by this paper
• A new approach to variable selection in least squares problems

  2000cited by this paper
• Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations

  2000influential reference
• REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems

  1994cited by this paper
• A nonsmooth version of Newton's method

  1993cited by this paper
• Regularization methods for large-scale problems

  1993cited by this paper
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

  1993cited by this paper
• Globally Convergent Newton Methods for Nonsmooth Equations

  1992cited by this paper
• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems

  1991cited by this paper
• Newton's Method for B-Differentiable Equations

  1990cited by this paper
• Determining Surface Temperatures from Interior Observations

  1982cited by this paper
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation

  1976cited by this paper
• © Institute of Mathematical Statistics, 2004 LEAST ANGLE REGRESSION

  year unknowncited by this paper

• A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

  2026cites this paper
• A globalized inexact semismooth Newton method for strongly convex optimal control problems

  2025cites this paper
• An Efficient Active-Set method With Applications to Sparse Approximations and Risk Minimization

  2024cites this paper
• Identification of Sparsely Representable Diffusion Parameters in Elliptic Problems

  2024cites this paper
• An active-set method for sparse approximations. Part II: General piecewise-linear terms

  2023cites this paper
• An active-set method for sparse approximations. Part I: Separable $\ell_1$ terms

  2022influential citation
• A semismooth Newton-proximal method of multipliers for 𝓁1-regularized convex quadratic programming

  2022cites this paper
• Algorithms based on operator-averaged operators

  2021cites this paper
• A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization

  2021cites this paper
• Error Estimations for Total Variation Type Regularization

  2021cites this paper
• Optimizing Top- $k$ Multiclass SVM via Semismooth Newton Algorithm

  2018cites this paper
• A Semi-smooth Newton Method for Inverse Problem with Uniform Noise

  2017cites this paper
• Numerical methods and second order theory for nonsmooth problems

  2016cites this paper
• Geometric Descent Method for Convex Composite Minimization

  2016cites this paper
• A family of second-order methods for convex ℓ1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1$$\end{document}-

  2015cites this paper
• A globally convergent and locally quadratically convergent modified B-semismooth Newton method for $\ell_1$-penalized minimization

  2015influential citation