Pages that link to "Item:Q2910890"
From MaRDI portal
The following pages link to Randomized Smoothing for Stochastic Optimization (Q2910890):
Displaying 30 items.
- A sparsity preserving stochastic gradient methods for sparse regression (Q457215) (← links)
- Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription (Q1661478) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems (Q1680973) (← links)
- On the convergence rate issues of general Markov search for global minimum (Q1685583) (← links)
- Gradient-free method for nonsmooth distributed optimization (Q2018475) (← links)
- Randomized smoothing variance reduction method for large-scale non-smooth convex optimization (Q2033403) (← links)
- A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization (Q2103421) (← links)
- Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Sample average approximations of strongly convex stochastic programs in Hilbert spaces (Q2688927) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- Penalty methods with stochastic approximation for stochastic nonlinear programming (Q2970100) (← links)
- Rejoinder (Q4690950) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Bias Reduction in Sample-Based Optimization (Q5026842) (← links)
- Optimal Algorithms for Non-Smooth Distributed Optimization in Networks (Q5214253) (← links)
- An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration (Q5231671) (← links)
- Extragradient Method with Variance Reduction for Stochastic Variational Inequalities (Q5737725) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization (Q5962719) (← links)
- Gradient-free federated learning methods with \(l_1\) and \(l_2\)-randomization for non-smooth convex stochastic optimization problems (Q6053598) (← links)
- An Improved Unconstrained Approach for Bilevel Optimization (Q6076870) (← links)
- Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems (Q6114895) (← links)
- Convergence properties of stochastic proximal subgradient method in solving a class of composite optimization problems with cardinality regularizer (Q6536946) (← links)
- Leveraging randomized smoothing for optimal control of nonsmooth dynamical systems (Q6551655) (← links)
- A new computational framework for log-concave density estimation (Q6590464) (← links)
- Optimality and duality for nonconvex fuzzy optimization using granular differentiability method (Q6608278) (← links)
- Stochastic zeroth order descent with structured directions (Q6642789) (← links)
- Nonsmooth projection-free optimization with functional constraints (Q6642795) (← links)