• CGLS

  • Referenced in 8 articles [sw07879]
  • zero order stationary point is established for nonsmooth convex functions, and convergence to a first...
  • SERK2

  • Referenced in 8 articles [sw10426]
  • ODEs. Numerical experiments with both smooth and nonsmooth data support the efficiency and accuracy...
  • SO-I

  • Referenced in 7 articles [sw10100]
  • performance of SO-I, a genetic algorithm, Nonsmooth Optimization by Mesh Adaptive Direct Search (NOMAD...
  • CARTopt

  • Referenced in 4 articles [sw08364]
  • CARTopt: a random search method for nonsmooth unconstrained optimization A random search algorithm for unconstrained ... local nonsmooth optimization is described. The algorithm forms a partition on ℝ n using classification ... sampling phases provides an effective method for nonsmooth optimization. The sequence of iterates...
  • NSOLIB

  • Referenced in 3 articles [sw07874]
  • NSOLIB is a Fortran subroutine library for nonsmooth and nonconvex optimization problems with single ... simple bounds for variables, linear, nonlinear or nonsmooth constraints, or all of them ... packages do not contain efficient codes for nonsmooth optimization...
  • DISNEL

  • Referenced in 5 articles [sw00207]
  • nonlinear programs, including those that rely on nonsmooth techniques.\parThe general nonlinear program is solved...
  • GANSO

  • Referenced in 4 articles [sw00319]
  • number of modern methods of global and nonsmooth continuous optimization, based on the ideas...
  • LSA

  • Referenced in 4 articles [sw22887]
  • variable metric updates. Subroutine PSEN, intended for nonsmooth partially separable optimization problems, is based...
  • ChebCoInt

  • Referenced in 4 articles [sw32042]
  • nonlinear instances, with both smooth and nonsmooth kernels. We describe a Matlab toolbox which implements...
  • LiPsMin

  • Referenced in 2 articles [sw26236]
  • ADOL-C which are embedded in the nonsmooth solver LiPsMin. Finally, minimax problems from robust ... comparison of LiPsMin with other nonsmooth optimization methods are discussed...
  • LMBM

  • Referenced in 3 articles [sw06158]
  • memory bundle method for general, possible nonconvex, nonsmooth (nondifferentiable) large-scale minimization. Both the unconsrained...
  • TMAC

  • Referenced in 3 articles [sw15565]
  • problems, which can be both smooth and nonsmooth, convex and nonconvex, as well as constrained...
  • SpaRSA

  • Referenced in 3 articles [sw20467]
  • smooth convex function and a nonsmooth, possibly nonconvex regular izer. We propose iterative methods...
  • FOPID

  • Referenced in 3 articles [sw20912]
  • phase margin. A novel approach based on nonsmooth optimization techniques is used. Two types...
  • Modulopt

  • Referenced in 1 article [sw05201]
  • collection, whose problems can be smooth or nonsmooth and are issued from various application areas...
  • LambdaMF

  • Referenced in 1 article [sw17493]
  • LambdaMF: Learning nonsmooth ranking functions in matrix factorization using lambda. This paper emphasizes optimizing ranking...
  • PNOPT

  • Referenced in 1 article [sw20469]
  • convex functions: a smooth function and a nonsmooth function with a simple proximal mapping...
  • MPDopt

  • Referenced in 1 article [sw23094]
  • this versatile method to a class of nonsmooth systems in which the dynamical equation governing...
  • Stellar

  • Referenced in 1 article [sw23843]
  • improvement operations, including vertex smoothing by nonsmooth optimization, stellar flips and other topological transformations, vertex...