• Ipopt

  • Referenced in 600 articles [sw04808]
  • denote the lower and upper bounds on the constraints, and the vectors ... bounds on the variables x. The functions f(x) and g(x) can be nonlinear ... twice continuously differentiable. Note that equality constraints can be formulated in the above formulation...
  • NPSOL

  • Referenced in 147 articles [sw07420]
  • smooth function subject to constraints, which may include simple bounds on the variables, linear constraints ... provides subroutines to define the objective and constraints functions and (optionally) their first derivatives. NPSOL ... solution of a QP subproblem. Bounds, linear constraints, and nonlinear constraints are treated separately. Hence...
  • MINOS

  • Referenced in 440 articles [sw05095]
  • nonlinear programs. The objective function and constraints may be linear or nonlinear, or a mixture ... lower bounds on the variables are handled efficiently. File formats for constraint and basis data...
  • INTOPT_90

  • Referenced in 304 articles [sw04705]
  • numerical approach in a branch and bound pattern touching many software details. The chapter ... constraints (within a box frame). The solution procedures are based on branch and bound, infeasibility...
  • BOBYQA

  • Referenced in 60 articles [sw04769]
  • variables without derivatives subject to simple bound constraints. There are no restrictions...
  • EGO

  • Referenced in 313 articles [sw07588]
  • costly box-bounded global optimization problems with additional linear, nonlinear and integer constraints. The idea...
  • TRICE

  • Referenced in 46 articles [sw05197]
  • minimization problems with nonlinear equality constraints and simple bounds on some of the variables ... rely on matrix factorizations of the linearized constraints but use solutions of the linearized state ... strict feasibility with respect to the bound constraints by using an affine scaling method proposed...
  • Knapsack

  • Referenced in 452 articles [sw04723]
  • objective function subject to a single resource constraint. Several variants of the classical ... will be considered with respect to relaxations, bounds, reductions and other algorithmic techniques...
  • BARON

  • Referenced in 305 articles [sw00066]
  • constraint propagation, interval analysis, and duality in its reduce arsenal with enhanced branch and bound...
  • OOQP

  • Referenced in 37 articles [sw04743]
  • Huber regression problems, and QPs with bound constraints. OOQP also can be used...
  • RealPaver

  • Referenced in 50 articles [sw04401]
  • allows modeling and solving nonlinear and nonconvex constraint satisfaction and optimization problems over the real ... discrete, have to be bounded. Functions and constraints have to be defined by analytical expressions ... existence of solutions to a set of constraints. Moreover, it is able to enclose ... interval-based computations in a branch-and-bound framework. Its key feature is to combine...
  • PNEW

  • Referenced in 67 articles [sw06157]
  • nondifferentiable optimization with simple bounds and general linear constraints. Subroutine PMIN, intended for minimax optimization...
  • DFL

  • Referenced in 25 articles [sw05163]
  • several variables subject to simple bound constraints where some of the variables are restricted...
  • MINTO

  • Referenced in 132 articles [sw04587]
  • branch-and-bound algorithm with linear programming relaxations. It also provides automatic constraint classification, preprocessing...
  • IR Tools

  • Referenced in 22 articles [sw26721]
  • term, and methods that can impose bound constraints on the computed solutions. All the iterative...
  • NLopt

  • Referenced in 80 articles [sw11789]
  • millions of parameters and thousands of constraints). Both global and local optimization algorithms. Algorithms using ... unconstrained optimization, bound-constrained optimization, and general nonlinear inequality/equality constraints. Free/open-source software under...
  • GLOPT

  • Referenced in 19 articles [sw00359]
  • block-separable objective function subject to bound constraints and block-separable constraints. It finds ... global minimizer. \parGLOPT uses a branch and bound technique to split the problem recursively into ... neither derivatives nor simultaneous information about several constraints. Numerical results are already encouraging. Work...
  • SQOPT

  • Referenced in 17 articles [sw07860]
  • term, or the number of active constraints and bounds is nearly as large ... large linear and quadratic problems with sparse constraint matrices. A quadratic term 1/2x ... procedure, scaling, and elastic bounds on any number of constraints and variables. SQOPT is part...
  • QPOPT

  • Referenced in 17 articles [sw07859]
  • function subject to linear constraints and simple upper and lower bounds. QPOPT may also ... method is most efficient when many constraints or bounds are active at the solution. QPOPT...