• Ipopt

• Referenced in 589 articles [sw04808]
• nonlinear and nonconvex, but should be twice continuously differentiable. Note that equality constraints...

• BARON

• Referenced in 305 articles [sw00066]
• BARON is a computational system for solving nonconvex optimization problems to global optimality. Purely continuous...

• SQPlab

• Referenced in 143 articles [sw05161]
• defining the problem can be nonlinear and nonconvex, but must be differentiable. A particular attention ... hard when the quadratic objective is nonconvex. On the other hand, as a Newton method...

• KNITRO

• Referenced in 165 articles [sw00490]
• nonlinear smooth optimization problems, both convex and nonconvex. It is also effective for nonlinear regression...

• GradSamp

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

• sparsenet

• Referenced in 68 articles [sw19133]
• package SparseNet: coordinate descent with nonconvex penalties. We address the problem of sparse selection ... linear models. A number of nonconvex penalties have been proposed in the literature for this...

• alphaBB

• Referenced in 49 articles [sw06249]
• Global Optimization Method for General Constrained Nonconvex Problems. A branch and bound global optimization method ... ffBB, for general continuous optimization problems involving nonconvexities in the objective function and/or constraints ... presented. The nonconvexities are categorized as being either of special structure or generic. A convexrelaxation ... nonconvexproblem is obtained by (i) replacing all nonconvex terms of special structure (i.e. bilinear, fractional...

• ANTIGONE

• Referenced in 79 articles [sw09241]
• Mixed-Integer Quadratic Optimizer, GloMIQO, to general nonconvex terms. The purpose of this paper...

• HIFOO

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

• iPiano

• Referenced in 42 articles [sw09623]
• iPiano: inertial proximal algorithm for nonconvex optimization. In this paper we study an algorithm ... minimization problem composed of a differentiable (possibly nonconvex) and a convex (possibly nondifferentiable) function ... makes the algorithm robust for usage on nonconvex problems. The convergence result is obtained based...

• NIMBUS

• Referenced in 63 articles [sw04339]
• method is capable of handling several nonconvex locally Lipschitz continuous objective functions subject to nonlinear...

• RealPaver

• Referenced in 50 articles [sw04401]
• Realpaver allows modeling and solving nonlinear and nonconvex constraint satisfaction and optimization problems over...

• LMIRank

• Referenced in 32 articles [sw04823]
• generalization of this problem. It is a nonconvex feasibility problem de¯ned by LMI constraints...

• QuadProgBB

• Referenced in 28 articles [sw13485]
• QuadProgBB: Globally solving nonconvex quadratic programming...

• LaGO

• Referenced in 19 articles [sw02040]
• heuristic) Branch and Cut algorithm for nonconvex MINLPs” and in the slides of the talk ... LaGO - Branch and Cut for nonconvex block-separable MINLPs in the absence of algebraic formulations...

• MPBNGC

• Referenced in 18 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...

• QPA

• Referenced in 20 articles [sw04296]
• iterative working-set method for large-scale nonconvex quadratic programming We consider a working...

• QSM

• Referenced in 19 articles [sw06161]
• quasi-secant method for nonsmooth possibly nonconvex minimization. The user can employ either analytically calculated...

• PBNCGC

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

• MINOTAUR

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