# DFO algorithms for constrained optimization

**URL:** <https://discourse.julialang.org/t/dfo-algorithms-for-constrained-optimization/13882>\
**Category:** Optimization (Mathematical)\
**Created:** [August 22, 2018, 1:32pm UTC](https://discourse.julialang.org/t/dfo-algorithms-for-constrained-optimization/13882 "2018-08-22T13:32:27Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![ivborissov](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/ivborissov/32/2841_2.png) [@ivborissov](https://discourse.julialang.org/u/ivborissov)\
**Post date:** [August 22, 2018, 1:32pm UTC](https://discourse.julialang.org/t/dfo-algorithms-for-constrained-optimization/13882/1 "2018-08-22T13:32:27Z")

</div>

Hi, could you please recommend me “free” solvers/algorithms for derivative-free optimization which support inequality/equality and bound constraints. Currently I use `AUGLAG` from `NLopt` with `NELDERMEAD`,`SBPLX` or `BOBYQA` as local optimization algorithms but I want to compare it with other JUMP supported solvers.