Pages that link to "Item:Q353174"
From MaRDI portal
The following pages link to Subgradient method for nonconvex nonsmooth optimization (Q353174):
Displaying 13 items.
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm (Q479211) (← links)
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression (Q515771) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians (Q1626525) (← links)
- A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
- Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks (Q6161107) (← links)
- Generalized-Hukuhara subdifferential analysis and its application in nonconvex composite interval optimization problems (Q6492558) (← links)
