ganah

> hello, you can write this cost function into the form 0.5*z^T*P*z+q^T*z, (equation(2) in paper https://arxiv.org/pdf/1703.00443.pdf), which is a general form of quadratic programming. in this way, x_i would be...

@goulart-paul Hello Prof. Goulart, I've encountered similar problem. I tried osqp to solve the same input data set for 20 times, two of them failed (solution diverge and unacceptable) due...

> That's correct, we don't have general state constraints implemented thx for reply. i think i can try, if it will work, expressing x_k+1 in the form of a*x_init+sum{b_i*u_i}, therefore...

> sorry, i did not continue this assumption but turned to build own optimization network. so, its feasibility still needs to be verified.

* LF3DP * https://github.com/sichaozhang1112/LF3DP * GANAH * https://github.com/sichaozhang1112/PEANUX * Draw a Closed-Loop Sketch of Dream