On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
From MaRDI portal
Publication:2082285
Recommendations
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- On Global Linear Convergence in Stochastic Nonconvex Optimization for Semidefinite Programming
- On the convergence rate for stochastic approximation in the nonsmooth setting
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Convergence of simultaneous perturbation stochastic approximation for nondifferentiable optimization
- scientific article; zbMATH DE number 3843512
- scientific article; zbMATH DE number 2214457
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- scientific article; zbMATH DE number 3896193
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
Cites work
- A basic course in probability theory
- A fast hybrid algorithm for large-scale \(l_{1}\)-regularized logistic regression
- A nonsmooth version of Newton's method
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- A semismooth Newton method with multidimensional filter globalization for l₁-optimization
- A Stochastic Approximation Method
- A stochastic quasi-Newton method for large-scale optimization
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An interior-point method for large-scale l₁-regularized logistic regression
- Block stochastic gradient iteration for convex and nonconvex optimization
- Computing a Trust Region Step
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Convex analysis and monotone operator theory in Hilbert spaces
- Deep learning: methods and applications
- Exact and inexact subsampled Newton methods for optimization
- Extragradient Method with Variance Reduction for Stochastic Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 6253925 (Why is no real title available?)
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Newton-type methods for non-convex optimization under inexact Hessian information
- Nonsmooth Equations: Motivation and Algorithms
- On the use of stochastic Hessian information in optimization methods for machine learning
- Optimization for simulation: theory vs. practice
- Optimization methods for large-scale machine learning
- Optimization with sparsity-inducing penalties
- Parallel stochastic Newton method
- Probability with Martingales
- Proximal Newton-type methods for minimizing composite functions
- Proximité et dualité dans un espace hilbertien
- Sample size selection in optimization methods for machine learning
- Second-order stochastic optimization for machine learning in linear time
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Signal Recovery by Proximal Forward-Backward Splitting
- Stochastic block mirror descent methods for nonsmooth and stochastic optimization
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
- Stochastic simulation: Algorithms and analysis
- Sub-sampled Newton methods
- Understanding machine learning. From theory to algorithms
- User-friendly tail bounds for sums of random matrices
Cited in
(7)- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
- On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization
- A comparison of global and semi-local approximation in \(T\)-stage stochastic optimization
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- An accelerated stochastic mirror descent method
This page was built for publication: On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082285)
