Pages that link to "Item:Q3144018"

The following pages link to Iterative regularization with a general penalty term—theory and application to <i>L</i> ¹ and <i>TV</i> regularization (Q3144018):

Displaying 30 items.

• Iterative regularization via dual diagonal descent (Q1703168) (← links)
• Iterative regularization for constrained minimization formulations of nonlinear inverse problems (Q2114823) (← links)
• Convergence rates of a dual gradient method for constrained linear ill-posed problems (Q2159243) (← links)
• An accelerated Kaczmarz type method for nonlinear inverse problems in Banach spaces with uniformly convex penalty (Q2222156) (← links)
• Inexact Newton regularization in Banach spaces based on two-point gradient method with uniformly convex penalty terms (Q2227681) (← links)
• Regularization of inverse problems by two-point gradient methods in Banach spaces (Q2334062) (← links)
• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• Inexact Newton--Landweber Iteration in Banach Spaces with NonSmooth Convex Penalty Terms (Q3196609) (← links)
• A revisit on Landweber iteration (Q3298409) (← links)
• (Q4719192) (← links)
• On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856) (← links)
• Accelerated Landweber iteration with convex penalty for linear inverse problems in Banach spaces (Q4982029) (← links)
• The two-point gradient methods for nonlinear inverse problems based on Bregman projections (Q5000586) (← links)
• A novel two-point gradient method for regularization of inverse problems in Banach spaces (Q5039367) (← links)
• Generalized inexact Newton regularization for nonlinear ill-posed problems in Banach spaces (Q5071184) (← links)
• Fast subspace optimization method for nonlinear inverse problems in Banach spaces with uniformly convex penalty terms (Q5210420) (← links)
• Alternating Direction Method of Multipliers for Linear Inverse Problems (Q5741060) (← links)
• Accelerated Iterative Regularization via Dual Diagonal Descent (Q5853571) (← links)
• Implicit regularization with strongly convex bias: Stability and acceleration (Q5873931) (← links)
• Heuristic rule for inexact Newton-Landweber iteration with convex penalty terms of nonlinear: ill-posed problems (Q6101032) (← links)
• Stochastic mirror descent method for linear ill-posed problems in Banach spaces (Q6101039) (← links)
• A fast adaptive algorithm for nonlinear inverse problems with convex penalty (Q6103379) (← links)
• Dual gradient method for ill-posed problems using multiple repeated measurement data (Q6165999) (← links)
• Deep unfolding as iterative regularization for imaging inverse problems (Q6194962) (← links)
• A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)
• A two-step accelerated Landweber-type iteration regularization algorithm for sparse reconstruction of electrical impedance tomography (Q6551474) (← links)
• Uniqueness and numerical inversion in bioluminescence tomography with time-dependent boundary measurement (Q6557692) (← links)
• An accelerated inexact Newton regularization scheme with a learned feature-selection rule for non-linear inverse problems (Q6581199) (← links)
• Extract the information via multiple repeated observations under randomly distributed noise (Q6583084) (← links)
• Fast iterative regularization by reusing data (Q6583087) (← links)