Random minibatch subgradient algorithms for convex problems with functional constraints
From MaRDI portal
Publication:2338088
DOI10.1007/s00245-019-09609-7zbMath1435.90107arXiv1903.02117OpenAlexW2972606536WikidataQ127243558 ScholiaQ127243558MaRDI QIDQ2338088
Publication date: 20 November 2019
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.02117
convergence ratesconvex minimizationfunctional constraintssubgradient algorithmsrandom minibatch projection algorithms
Related Items
General convergence analysis of stochastic first-order methods for composite optimization, Faster Randomized Block Kaczmarz Algorithms, Random minibatch subgradient algorithms for convex problems with functional constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- Introductory lectures on convex optimization. A basic course.
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Linear convergence of first order methods for non-strongly convex optimization
- Weak Sharp Minima in Mathematical Programming
- Iterative regularization with a general penalty term—theory and application to L 1 and TV regularization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Acceleration of Stochastic Approximation by Averaging
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Energy-based sensor network source localization via projection onto convex sets
- A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Proximal Distance Algorithms: Theory and Examples
- Minimization of unsmooth functionals
