Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization

DOI10.1137/19M1304271zbMath1456.49023OpenAlexW3111397019MaRDI QIDQ5148398

Hamed Hassani, Aryan Mokhtari, Amin Karbasi, Zebang Shen

Publication date: 4 February 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/19m1304271

zbMATH Keywords

stochastic optimizationnonconvex minimizationvariance reductionconditional gradient methodsubmodular maximizationfirst order method

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)

Related Items (2)

Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ A stochastic non-monotone DR-submodular maximization problem over a convex set

Uses Software

• Saga

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• Gradient sliding for composite optimization
• Minimizing finite sums with the stochastic average gradient
• An analysis of the greedy algorithm for the submodular set covering problem
• Submodular functions: from discrete to continuous domains
• Submodular functions and optimization.
• Conditional Gradient Sliding for Convex Optimization
• On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
• Determinantal Point Processes for Machine Learning
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Deterministic Algorithms for Submodular Maximization Problems
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• A Stochastic Approximation Method
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

This page was built for publication: Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization