# Using Multi-start with local MINLP solvers in Julia

**URL:** <https://discourse.julialang.org/t/using-multi-start-with-local-minlp-solvers-in-julia/117634>\
**Category:** Optimization (Mathematical)\
**Created:** [July 30, 2024, 2:59pm UTC](https://discourse.julialang.org/t/using-multi-start-with-local-minlp-solvers-in-julia/117634 "2024-07-30T14:59:56Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![Lunima](https://avatars.discourse-cdn.com/v4/letter/l/d26b3c/32.png) [@Lunima](https://discourse.julialang.org/u/Lunima)\
**Post date:** [July 30, 2024, 2:59pm UTC](https://discourse.julialang.org/t/using-multi-start-with-local-minlp-solvers-in-julia/117634/1 "2024-07-30T14:59:56Z")

</div>

Hi everyone!

When reading the Knitro documentation I saw it could use a multi-start method to solver non-convex MINLP to global optimality even though it is a local solver. Is it possible to implement such a method in Julia with a local MINLP solver like Juniper (with NLP subsolver Ipopt) ? There is the MultistartOptimization.jl library but does it work with MINLP solver or only NLP solvers like NLopt (which is used as example in the documentation) ?

Thanks!

---

<div class="post-metadata">

**Author:** ![odow](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/odow/32/28685_2.png) [@odow](https://discourse.julialang.org/u/odow)\
**Post date:** [July 31, 2024, 8:17am UTC](https://discourse.julialang.org/t/using-multi-start-with-local-minlp-solvers-in-julia/117634/2 "2024-07-31T08:17:37Z")

</div>

There is nothing built in to Juniper or Ipopt for multistart. You’ll need to implement this manually by wrapping the solve in a for loop to try different starting points.
