Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
From MaRDI portal
Publication:2117629
Recommendations
- A new gradient method for ill-posed problems
- The instability of some gradient methods for ill-posed problems
- A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- Convergence of the gradient method for ill-posed problems
Cites work
- scientific article; zbMATH DE number 3871041 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3320716 (Why is no real title available?)
- scientific article; zbMATH DE number 3052543 (Why is no real title available?)
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Definitions and examples of inverse and ill-posed problems
- Fast gradient descent for convex minimization problems with an oracle producing a ( , L)-model of function at the requested point
- Fast primal-dual gradient method for strongly convex minimization problems with linear constraints
- Gradient methods for problems with inexact model of the objective
- Lectures on convex optimization
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Universal gradient methods for convex optimization problems
- Universal method for stochastic composite optimization problems
Cited in
(3)
This page was built for publication: Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117629)