New penalized stochastic gradient methods for linearly constrained strongly convex optimization
From MaRDI portal
Cites work
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A smooth inexact penalty reformulation of convex problems with linear constraints
- An introduction to continuous optimization for imaging
- An optimal randomized incremental gradient method
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Consistency of multidimensional convex regression
- Exact Penalty Functions in Constrained Optimization
- First-order methods in optimization
- Global and fine approximation of convex functions
- Gradient methods for minimizing composite functions
- Graph implementations for nonsmooth convex programs
- Incremental constraint projection methods for variational inequalities
- Iteration-complexity of first-order penalty methods for convex programming
- Katyusha: the first direct acceleration of stochastic gradient methods
- Lectures on convex optimization
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Minimizing finite sums with the stochastic average gradient
- Multinomial logistic regression algorithm
- Nonparametric least squares estimation of a multivariate convex regression function
- Optimization methods for large-scale machine learning
- Predictive control for linear and hybrid systems
- Random algorithms for convex minimization problems
- Smooth minimization of non-smooth functions
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Stochastic Primal-Dual Hybrid Gradient Algorithm with Arbitrary Sampling and Imaging Applications
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- The Isotonic Regression Problem and Its Dual
Cited in
(4)- A SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
- Adaptive-batch stochastic gradient descent for constrained optimization based on relaxed barrier functions
- Robust stochastic gradient descent for linearly constrained problems via adaptive barrier amplification
- Jump-diffusion dynamics of constrained SGD: taming transient macroscopic shocks via linear coupled scheduling
This page was built for publication: New penalized stochastic gradient methods for linearly constrained strongly convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998501)
