scientific article; zbMATH DE number 7255136
From MaRDI portal
Publication:4969174
Hamed Hassani, Aryan Mokhtari, Amin Karbasi
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1804.09554
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic optimizationgreedy algorithmconvex minimizationFrank-Wolfe algorithmgradient averagingsubmodular maximizationconditional gradient methods
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Stochastic programming (90C15) Approximation algorithms (68W25)
Related Items (9)
FrankWolfe.jl: A High-Performance and Flexible Toolbox for Frank–Wolfe Algorithms and Conditional Gradients ⋮ Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ A unified analysis of stochastic gradient‐free Frank–Wolfe methods ⋮ Distributed strategy selection: a submodular set function maximization approach ⋮ Unnamed Item ⋮ A stochastic non-monotone DR-submodular maximization problem over a convex set ⋮ Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points ⋮ Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization ⋮ Generalized stochastic Frank-Wolfe algorithm with stochastic ``substitute gradient for structured convex optimization
Cites Work
- An analysis of the greedy algorithm for the submodular set covering problem
- Submodular functions and optimization.
- Global Convergence of Online Limited Memory BFGS
- On Multiplicative Weight Updates for Concave and Submodular Function Maximization
- Maximizing Non-monotone Submodular Functions
- A threshold of ln n for approximating set cover
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Large-Scale Machine Learning with Stochastic Gradient Descent
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- AdWords and generalized online matching
- Lectures on Stochastic Programming
- Feasible direction methods for stochastic programming problems
- An analysis of approximations for maximizing submodular set functions—I
- Ergodic Stochastic Optimization Algorithms for Wireless Communication and Networking
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Submodular Maximization with Cardinality Constraints
- Online matching with concave returns
- A merit function approach to the subgradient method with averaging
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- A Stochastic Approximation Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
