[petsc-dev] TAOIPM v. IPOPT

[Pierre Jolivet]

Hello,
I’m trying to solve the following constrained problem:
min   x0*x3*(x0+x1+x2) + x2
s.t.    x0*x1*x2*x3 >= 25 (a)
         x0**2 + x1**2 + x2**2 + x3**2 = 40
         1 <= x0, x1, x2, x3 <= 5
I modified src/tao/constrained/examples/tutorials/toy.c (you can git diff the attached file) to try to solve this problem.
If I remove the inequality constraint (a), by commenting out line 69 and line 72, both TAOIPM and IPOPT converge to the same solution
1.
5.
3.60555
1.
If I try to impose the inequality (a), TAOIPM does not converge, while I get the desired solution from IPOPT (1	4.742999644	3.821149979	1.379408293)
Do you see what I’m doing wrong?

Thanks in advance for your help,
Pierre

-------------- next part --------------
A non-text attachment was scrubbed...
Name: toy.c
Type: application/octet-stream
Size: 10455 bytes
Desc: not available
URL: <http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20190615/e094300d/attachment.obj>