• MINOTAUR

  • Referenced in 18 articles [sw06268]
  • relaxations of multilinear terms that arise in nonconvex mixed integer optimization problems. The goal...
  • TRIPACK

  • Referenced in 15 articles [sw00978]
  • triangulation. This effectively allows for a nonconvex or multiply connected triangulation (the complement...
  • HANSO

  • Referenced in 12 articles [sw05271]
  • methods. For general unconstrained minimization: convex or nonconvex, smooth or nonsmooth, including BFGS, limited memory...
  • HOPSPACK

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

  • Referenced in 11 articles [sw06267]
  • points. The code is applicable also to nonconvex optimization problems...
  • QICD

  • Referenced in 10 articles [sw19679]
  • Iterative Coordinate Descent Algorithm for High-dimensional Nonconvex Penalized Quantile Regression. This algorithm combines...
  • MuShROOM

  • Referenced in 8 articles [sw12000]
  • describes new tools for solving the arising nonconvex quadratic subproblems such as a new parametric...
  • qpHPSC

  • Referenced in 8 articles [sw12001]
  • describes new tools for solving the arising nonconvex quadratic subproblems such as a new parametric...
  • feeLLGood

  • Referenced in 7 articles [sw18093]
  • conserve the magnetization norm, which is a nonconvex constraint, and be energy-decreasing unless there...
  • MUSCOP

  • Referenced in 6 articles [sw06143]
  • efficient solver for the resulting, possibly nonconvex QP. Furthermore we construct three illustrative, counter-intuitive...
  • CCA

  • Referenced in 5 articles [sw30994]
  • contains efficient algorithms to manipulate convex and nonconvex univariate functions, and to compute fundamental convex...
  • Nonconvex Pareto Navigator

  • Referenced in 2 articles [sw31871]
  • Interactive Nonconvex Pareto Navigator for multiobjective optimization. We introduce a new interactive multiobjective optimization method ... operating in the objective space called Nonconvex Pareto Navigator. It extends the Pareto Navigator method ... nonconvex problems. An approximation of the Pareto optimal front in the objective space is first ... given Pareto optimal outcomes. Besides handling nonconvexity, the new method contains new options for directing...
  • SRFPACK

  • Referenced in 4 articles [sw00908]
  • domain of the fitting function may be nonconvex or multiply connected, and the surface...
  • NSOLIB

  • Referenced in 4 articles [sw07874]
  • Fortran subroutine library for nonsmooth and nonconvex optimization problems with single or multiple objective functions...
  • LPCCbnc

  • Referenced in 4 articles [sw31750]
  • complementarity constraints results in a nonconvex optimization problem. We develop a branch-and-cut algorithm...
  • RBoost

  • Referenced in 2 articles [sw29975]
  • Noise-Robust Boosting Algorithm Based on a Nonconvex Loss Function and the Numerically Stable Base ... with AdaBoost. RBoost1 and RBoost2 optimize a nonconvex loss function of the classification margin. Because...
  • BTN

  • Referenced in 3 articles [sw00094]
  • Lanczos method, which is numerically stable for nonconvex problems. In addition to the optimization software...
  • LMBM

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

  • Referenced in 3 articles [sw14722]
  • programming is an organized heuristic for solving nonconvex problems that involve objective and constraint functions...
  • TMAC

  • Referenced in 3 articles [sw15565]
  • both smooth and nonsmooth, convex and nonconvex, as well as constrained and unconstrained. The algorithms...