Thank you. I have tried with the option suggested there. It detects 1 linearly dependent equality constraint and takes it out. However, the solver converges to “a point of local infeasibility” which is not the expected feasible solution.
Unfortunately, as mentioned in the issue, it seems it is not possible to “run Ipopt anyway”.
Did you find any solver which can handle this situation? I saw your comparison and filterSQP performs well. However, as far as I know, SQP is gradient-based and does not use the second-derivative information of the constraints. Am I right? I don’t know what filterSQP is though.
I have tried with SLSQP implementation from NLOPT library but it throws ArgumentError: invalid NLopt arguments: too many equality constraints
On the other hand, do you have a Julia interface for your work?
Thank you.