Convex optimization in Hilbert space with applications to inverse problems
arXiv:1703.00267
Abstract
In this paper we propose accelerated gradient descent schemes for convex optimization problems in Hilbert space. We consider inexact oracle case.
arXiv comment20 pages. Submitted to Applied Numerical Mathematics
References in corpus (4)
- Stochastic Intermediate Gradient Method for Convex Problems with Inexact Stochastic Oracle
- Universal fast gradient method for stochastic composit optimization problems
- Mirror version of similar triangles method for constrained optimization problems
- Dual approaches to the strongly convex simple function minimization problem under affine restrictions