Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

Solving a A-TKMP #3

Open
lrnv opened this issue Aug 4, 2020 · 0 comments
Open

Solving a A-TKMP #3

lrnv opened this issue Aug 4, 2020 · 0 comments

Comments

@lrnv
Copy link

lrnv commented Aug 4, 2020 •
edited
Loading

Hi,

I do want to solve the SDP problem from example (4.1) in this paper. This problem seem quite easy to solve, but i do not manage to make it work using polyopt.

Could you explain to me how i should translate it's expression to the polyopt SDPsolver ? It keep running until values goes +/- np.inf and LocalNormA returns an error.
@lrnv lrnv closed this as completed Aug 5, 2020
@lrnv lrnv changed the title Equality constraints Solving a A-TKMP Sep 16, 2020
@lrnv lrnv reopened this Sep 16, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@lrnv