A robust gradient sampling algorithm for nonsmooth, nonconvex optimization The authors describe a practical and robust algorithm for computing the local minima of a continuously differentiable function in n real variables, which is not convex and not even locally Lipschitz. The only request formulated is that the gradient of the function is easily computed where it is defined. (Source:

References in zbMATH (referenced in 49 articles , 1 standard article )

Showing results 1 to 20 of 49.
Sorted by year (citations)

1 2 3 next

  1. Grohs, P.; Hosseini, S.: $\varepsilon$-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds (2016)
  2. Yousefpour, Rohollah: Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (2016)
  3. Akbari, Z.; Yousefpour, R.; Reza Peyghami, M.: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (2015)
  4. Curtis, Frank E.; Que, Xiaocun: A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (2015)
  5. Huang, Yakui; Liu, Hongwei; Cong, Weijie: A note on the smoothing quadratic regularization method for non-Lipschitz optimization (2015)
  6. Karmitsa, Napsu: Diagonal bundle method for nonsmooth sparse optimization (2015)
  7. Borckmans, Pierre B.; Easter Selvan, S.; Boumal, Nicolas; Absil, P.-A.: A Riemannian subgradient algorithm for economic dispatch with valve-point effect (2014)
  8. Hinow, Peter: A nonsmooth program for jamming hard spheres (2014)
  9. Hintermüller, Michael; Wu, Tao: A superlinearly convergent $R$-regularized Newton scheme for variational models with concave sparsity-promoting priors (2014)
  10. Lin, Gui-Hua; Xu, Mengwei; Ye, Jane J.: On solving simple bilevel programs with a nonconvex lower level program (2014)
  11. Tang, Chun-Ming; Liu, Shuai; Jian, Jin-Bao; Li, Jian-Ling: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (2014)
  12. Xu, Mengwei; Ye, Jane J.: A smoothing augmented Lagrangian method for solving simple bilevel programs (2014)
  13. Garmanjani, R.; Vicente, L.N.: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization (2013)
  14. Hare, Warren; Macklem, Mason: Derivative-free optimization methods for finite minimax problems (2013)
  15. Hare, W.; Nutini, J.: A derivative-free approximate gradient sampling algorithm for finite minimax problems (2013)
  16. Lewis, Adrian S.; Overton, Michael L.: Nonsmooth optimization via quasi-Newton methods (2013)
  17. Mäkelä, Marko M.; Karmitsa, Napsu; Bagirov, Adil: Subgradient and bundle methods for nonsmooth optimization (2013)
  18. Chen, Michael Martin Xiaojun: Smoothing methods for nonsmooth, nonconvex minimization (2012)
  19. Colombo, Rinaldo M.; Garavello, Mauro; Lécureux-Mercier, Magali: A class of nonlocal models for pedestrian traffic (2012)
  20. Dreves, Axel; Kanzow, Christian; Stein, Oliver: Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems (2012)

1 2 3 next