• GradSamp

  • Referenced in 82 articles [sw05270]
  • robust gradient sampling algorithm for nonsmooth, nonconvex optimization The authors describe a practical and robust...
  • PNEW

  • Referenced in 57 articles [sw06157]
  • Subroutines PBUN and PNEW, intended for general nonsmooth problems, are based on bundle-type methods ... Subroutine PVAR is based on special nonsmooth variable metric methods. Besides the description of methods...
  • HIFOO

  • Referenced in 45 articles [sw05188]
  • linear systems is a difficult, nonconvex, nonsmooth optimization problem when the order of the controller ... depends on a hybrid algorithm for nonsmooth, nonconvex optimization based on quasi-Newton updating...
  • LDGB

  • Referenced in 29 articles [sw07134]
  • limited memory bundle method for large-scale nonsmooth optimization Many practical optimization problems involve nonsmooth ... lead to a failure due to the nonsmooth nature of the problem. On the other ... hand, none of the current general nonsmooth optimization methods is efficient in large-scale settings ... memory variable metric based bundle method for nonsmooth large-scale optimization. In addition, we introduce...
  • OrthoMADS

  • Referenced in 38 articles [sw07713]
  • quite good for both smooth and nonsmooth and constrained and unconstrained problems considered here...
  • SIMEM3 Renault

  • Referenced in 36 articles [sw04243]
  • algorithm. A convergence theorem is proved using nonsmooth analysis. Several numerical results illustrate the behaviour...
  • iPiano

  • Referenced in 30 articles [sw09623]
  • force. It can be seen as a nonsmooth split version of the Heavy-ball method...
  • PDDE-CONT

  • Referenced in 23 articles [sw08419]
  • high-dimensional traffic model, a (regularized) nonsmooth model for chattering, and the classical Mackey-Glass...
  • MPBNGC

  • Referenced in 16 articles [sw11891]
  • Multiobjective proximal bundle method for nonconvex nonsmooth optimization: Fortran subroutine MPBNGC 2.0. MPBNGC ... multiobjective proximal bundle method for nonconvex, nonsmooth (nondifferentiable) and generally constrained minimization. The software...
  • qLearn

  • Referenced in 14 articles [sw11117]
  • from data is Q-learning which involves nonsmooth operations of the data. This nonsmoothness causes...
  • NDA

  • Referenced in 12 articles [sw04663]
  • Subroutines PBUN and PNEW, intended for general nonsmooth problems, are based on bundle-type methods ... Subroutine PVAR is based on special nonsmooth variable metric methods. Besides the description of methods...
  • QSM

  • Referenced in 17 articles [sw06161]
  • implementation of the quasi-secant method for nonsmooth possibly nonconvex minimization. The user can employ...
  • PBNCGC

  • Referenced in 16 articles [sw06156]
  • multiobjective proximal bundle method for nonconvex, nonsmooth (nondifferentiable) and generally constrained minimization. The software...
  • NESUN

  • Referenced in 16 articles [sw28733]
  • problems, sometimes can be achieved even on nonsmooth problem instances...
  • Siconos

  • Referenced in 8 articles [sw25724]
  • software primarily targeted at modeling and simulating nonsmooth dynamical systems in C++ and in Python ... unilateral contact and Coulomb friction and impact (nonsmooth mechanics, contact dynamics, multibody systems dynamics...
  • NSO

  • Referenced in 6 articles [sw05272]
  • Nonsmooth optimization (NSO) refers to the general problem of minimizing (or maximizing) functions that ... functions involved in practical applications are often nonsmooth. That is, they are not necessarily differentiable ... briefly introduce the basic concepts of nonsmooth analysis and optimization...
  • HANSO

  • Referenced in 9 articles [sw05271]
  • unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS, limited memory BFGS and gradient...
  • EMP

  • Referenced in 8 articles [sw01086]
  • data fitting, min-max programming, multicriteria optimization, nonsmooth optimization, quadratic programming, or linear programming, subject...
  • HOPSPACK

  • Referenced in 8 articles [sw04187]
  • very general: functions can be noisy, nonsmooth and nonconvex, linear and nonlinear constraints are supported...
  • BEDFix

  • Referenced in 8 articles [sw04469]
  • this worst-case bound. BEDFix works for nonsmooth continuous functions, unlike methods that require gradient...