We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Solve a control problem with integer variables using direct code + SDP relaxation + convex solver (if relevant)
Example: Fuller with mixed constraints $u \in \lbrace -1, 1 \rbrace$, check D. Cebulla's talk at FGS 2024.
See also: refs. by D. Preda, S. Säger
The text was updated successfully, but these errors were encountered:
ocots
No branches or pull requests
Solve a control problem with integer variables using direct code + SDP relaxation + convex solver (if relevant)
Example: Fuller with mixed constraints$u \in \lbrace -1, 1 \rbrace$ , check D. Cebulla's talk at FGS 2024.
See also: refs. by D. Preda, S. Säger
The text was updated successfully, but these errors were encountered: