# Is there any way to emulate MATLAB's Isqlin in Julia?

**URL:** <https://discourse.julialang.org/t/is-there-any-way-to-emulate-matlabs-isqlin-in-julia/93394>\
**Category:** New to Julia\
**Tags:** optimization\
**Created:** [January 23, 2023, 11:38am UTC](https://discourse.julialang.org/t/is-there-any-way-to-emulate-matlabs-isqlin-in-julia/93394 "2023-01-23T11:38:32Z")\
**Posts on this page:** 1\
**Showing post:** 23

<div class="post-metadata">

**Author:** ![dpo](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/dpo/32/3335_2.png) [@dpo](https://discourse.julialang.org/u/dpo)\
**Post date:** [June 24, 2024, 11:31am UTC](https://discourse.julialang.org/t/is-there-any-way-to-emulate-matlabs-isqlin-in-julia/93394/23 "2024-06-24T11:31:16Z")

</div>

I hope it’s ok to revive this discussion, which was just brought to my attention. In case others are looking for ways to solve constrained linear least-squares problems, a solid option is our interior-point solver [RipQP.jl](https://github.com/JuliaSmoothOptimizers/RipQP.jl). There are more details in a related thread. Instead of repeating, here are links to the relevant bits:

- Formulate your constrained problem like so: [How to solve a large quadratic programming problem - #11 by dpo](https://discourse.julialang.org/t/how-to-solve-a-large-quadratic-programming-problem/111200/11)
- Example with code: [How to solve a large quadratic programming problem - #15 by geoffroyleconte](https://discourse.julialang.org/t/how-to-solve-a-large-quadratic-programming-problem/111200/15)

---

_[View the full topic](https://discourse.julialang.org/t/is-there-any-way-to-emulate-matlabs-isqlin-in-julia/93394)._