Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
type: Item
instance of: scholarly article
title: Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
zbMATH Open document ID: 1356.93097
DOI: 10.1134/S0005117916110114
author: A. A. Lagunovskaya
author: I. N. Usmanova
author: F. A. Fedorenko
author: Alexander V. Gasnikov
published in: Automation and Remote Control
publication date: 2017-02-17T00:00:00Z
Mathematics Subject Classification ID: 93E20
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6685619
MaRDI profile type: Publication
cites work: Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
cites work: Lectures on stochastic programming. Modeling and theory.
cites work: Robust Stochastic Approximation Approach to Stochastic Programming
cites work: Introduction to Stochastic Search and Optimization
cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Extremes and related properties of random sequences and processes
cites work: The concentration of measure phenomenon
cites work: Q4907706
cites work: Q3920436
cites work: Coordinate descent algorithms
full work available at URL: s0005117916110114
OpenAlex ID: W2554066544
description: scientific article; zbMATH DE number 6685619