Pages that link to "Item:Q5244401"
From MaRDI portal
The following pages link to A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401):
Displaying 26 items.
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions (Q1930995) (← links)
- On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization (Q2082285) (← links)
- Challenges in optimization with complex PDE-systems. Abstracts from the workshop held February 14--20, 2021 (hybrid meeting) (Q2131202) (← links)
- A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization (Q2149551) (← links)
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems (Q2161545) (← links)
- A stochastic primal-dual method for a class of nonconvex constrained optimization (Q2162528) (← links)
- Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
- An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
- Search Direction Correction with Normalized Gradient Makes First-Order Methods Faster (Q3382800) (← links)
- A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization (Q5002572) (← links)
- (Q5038021) (← links)
- A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization (Q5076721) (← links)
- Anderson Accelerated Douglas--Rachford Splitting (Q5146687) (← links)
- (Q5149020) (← links)
- A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization (Q5244401) (← links)
- Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization (Q5737735) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- Convergence analysis of a subsampled Levenberg-Marquardt algorithm (Q6047687) (← links)
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems (Q6051310) (← links)
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization (Q6102892) (← links)
- Newton-type methods with the proximal gradient step for sparse estimation (Q6130698) (← links)
- Hessian averaging in stochastic Newton methods achieves superlinear convergence (Q6165593) (← links)
- Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization (Q6195313) (← links)
- A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
- An efficient ADAM-type algorithm with finite elements discretization technique for random elliptic optimal control problems (Q6593352) (← links)
- A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization (Q6593829) (← links)