Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
From MaRDI portal
Publication:2117629
DOI10.1007/978-3-030-77876-7_11zbMath1487.90525MaRDI QIDQ2117629
Alexander V. Gasnikov, Vladislav Matyukhin, Nikita S. Novikov, Artem Vasin, Maxim A. Shishlenin, Sergey I. Kabanikhin
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_11
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal gradient methods for convex optimization problems
- Lectures on convex optimization
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Universal method for stochastic composite optimization problems
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Gradient methods for problems with inexact model of the objective
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point
- Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints
- Definitions and examples of inverse and ill-posed problems