• GradSamp

  • Referenced in 82 articles [sw05270]
  • robust gradient sampling algorithm for nonsmooth, nonconvex optimization The authors describe a practical and robust ... real variables, which is not convex and not even locally Lipschitz. The only request formulated...
  • NESUN

  • Referenced in 16 articles [sw28733]
  • present new methods for black-box convex minimization. They do not need to know ... smooth optimization problems, sometimes can be achieved even on nonsmooth problem instances...
  • iPiano

  • Referenced in 30 articles [sw09623]
  • iPiano: inertial proximal algorithm for nonconvex optimization. In this paper we study an algorithm ... differentiable (possibly nonconvex) and a convex (possibly nondifferentiable) function. The algorithm iPiano combines forward-backward ... force. It can be seen as a nonsmooth split version of the Heavy-ball method...
  • HANSO

  • Referenced in 9 articles [sw05271]
  • HANSO: Hybrid Algorithm for Non-Smooth Optimization A MATLAB package based on the BFGS ... general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS, limited memory BFGS...
  • GANSO

  • Referenced in 4 articles [sw00319]
  • nonsmooth continuous optimization, based on the ideas of A. Rubinov [Abstract convexity and global approximation...
  • TMAC

  • Referenced in 2 articles [sw15565]
  • variety of optimization problems, which can be both smooth and nonsmooth, convex and nonconvex ... mimics how a scientist writes down an optimization algorithm. Therefore, it is easy...
  • SpaRSA

  • Referenced in 3 articles [sw20467]
  • smooth convex function and a nonsmooth, possibly nonconvex regular izer. We propose iterative methods ... each step is obtained by solving an optimization subproblem involving a quadratic term with diagonal ... original problem. Under mild conditions (namely convexity of the regularizer), we prove convergence...
  • CGLS

  • Referenced in 8 articles [sw07879]
  • global & local search (CGLS) approach to global optimization. This paper presents a general approach that ... order stationary point is established for nonsmooth convex functions, and convergence to a first order...
  • DISNEL

  • Referenced in 5 articles [sw00207]
  • packages of the same family: DISPRO (discrete optimization) and PLANER (nonlinear programming).\parIn addition ... nonlinear programs, including those that rely on nonsmooth techniques.\parThe general nonlinear program is solved ... Pshenichnyi} [The linearization method (1983; Zbl. 533.49024)]; convex programs do not assume differentiability of functions...
  • PNOPT

  • Referenced in 1 article [sw20469]
  • PNOPT: Proximal Newton OPTimizer. PNOPT (pronounced pee-en-opt) is a MATLAB package that uses ... convex functions: a smooth function and a nonsmooth function with a simple proximal mapping...
  • BARON

  • Referenced in 266 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • BPMPD

  • Referenced in 38 articles [sw00088]
  • BPMPD is a state-of-the-art implementation...
  • CSDP

  • Referenced in 179 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • Gmsh

  • Referenced in 371 articles [sw00366]
  • Gmsh is a 3D finite element grid generator...
  • HSL

  • Referenced in 229 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • KNITRO

  • Referenced in 145 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 263 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • MA57

  • Referenced in 74 articles [sw00536]
  • MA57 - a code for the solution of sparse...
  • Maple

  • Referenced in 4663 articles [sw00545]
  • The result of over 30 years of cutting...