Pages that link to "Item:Q2483018"
From MaRDI portal
The following pages link to An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018):
Displayed 10 items.
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
- Nonsmooth multiobjective programming with quasi-Newton methods (Q2256315) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials (Q5745159) (← links)