Convex optimization in Hilbert space with applications to inverse problems

2017/03/01 by Alexander Gasnikov, Gasnikov, Alexander, Sergey Kabanikhin +5 · 1 citation
Mathematics · Computer Science · #Numerical methods in inverse problems #Stochastic Gradient Optimization Techniques #Analytic and geometric function theory

paper · pdf · doi:10.48550/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.

Cited by

• Optimal Algorithms for Distributed Optimization

Related

• Gradient Methods with Regularization for Constrained Optimization Problems and Their Complexity Estimates
• Greedy Strategies for Convex Optimization
• Gradient Methods for Problems with Inexact Model of the Objective
• On Certain Conditions for Convex Optimization in Hilbert Spaces
• On Weak and Strong Convergence of the Projected Gradient Method for\n Convex Optimization in real Hilbert Spaces