search

robotology / osqp-eigen

Simple Eigen-C++ wrapper for OSQP library
https://robotology.github.io/osqp-eigen/
BSD 3-Clause "New" or "Revised" License
385 stars 114 forks source link

why i set a hard problem, it can be solved, while i set a very easy problem(0,0,0,0,0,.....), it cant be solved , and the estimate get larger and larger #76

Open Leon-LXA opened 3 years ago

Leon-LXA commented 3 years ago

iter objective pri res dua res rho time 1 0.0000e+00 1.00e+00 1.40e+12 1.00e-01 4.63e-04s 200 1.2286e+11 2.24e+00 9.29e+10 5.14e-01 1.47e-03s 400 1.1636e+11 2.24e+00 2.62e+11 2.91e+00 2.34e-03s 600 1.2547e+11 2.24e+00 9.66e+10 2.91e+00 3.17e-03s 800 1.1924e+11 2.24e+00 2.94e+11 2.91e+00 3.97e-03s 975 1.0000e+20 2.24e+00 3.04e+11 2.91e+00 4.68e-03s

status: primal infeasible number of iterations: 975 run time: 4.70e-03s optimal rho estimate: 4.29e+00

[OsqpEigen::Solver::solve] The solution is unfeasible.

Leon-LXA commented 3 years ago

the answer should just be all zero

S-Dafarra commented 3 years ago

Hi @Richard-LXA, could you provide more details on the problem you are trying to solve?