Stochastic subgradient algorithm for nonsmooth nonconvex optimization
From MaRDI portal
Recommendations
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization
- Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Distributed stochastic nonsmooth nonconvex optimization
Cites work
- A Convergent Incremental Gradient Method with a Constant Step Size
- A neurodynamic approach for nonsmooth optimal power consumption of intelligent and connected vehicles
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints
- A sharp augmented Lagrangian-based method in constrained non-convex optimization
- A Stochastic Approximation Method
- Accelerating incremental gradient optimization with curvature information
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Benchmarking optimization software with performance profiles.
- Best practices for comparing optimization algorithms
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- scientific article; zbMATH DE number 5617354 (Why is no real title available?)
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Incremental subgradient methods for nondifferentiable optimization
- Large-scale machine learning with stochastic gradient descent
- Minimizing finite sums with the stochastic average gradient
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Numerical Optimization
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On augmented Lagrangians for optimization problems with a single constraint
- On the Convergence Rate of Incremental Aggregated Gradient Algorithms
- Support vector machine polyhedral separability in semisupervised learning
- The modified subgradient algorithm based on feasible values
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
This page was built for publication: Stochastic subgradient algorithm for nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6578251)
