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.

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

SDP should deal with linearly dependent constraints somehow #71

Open
rcurtin opened this issue Jan 19, 2019 · 1 comment
Open

SDP should deal with linearly dependent constraints somehow #71

rcurtin opened this issue Jan 19, 2019 · 1 comment

Comments

@rcurtin
Copy link
Member

rcurtin commented Jan 19, 2019

This is a port of mlpack/mlpack#404. There are some more details there. Here is the original description from @stephentu:

we need some strategy for dealing w/ a linearly dependent set of constraints. for LR-SDP, this isn't so big of a deal. but, this is especially key for the primal dual methods, which require this assumption so that various linear systems have unique solutions. we could either introduce a method which removes redundant constraints, or adapt the primal-dual method to handle degenerate linear systems.

note that, if we want the MVU SDP to work, then this will be necessary

@mlpack-bot
Copy link

mlpack-bot bot commented Apr 9, 2019

This issue has been automatically marked as stale because it has not had any recent activity. It will be closed in 7 days if no further activity occurs. Thank you for your contributions! 👍

@mlpack-bot mlpack-bot bot added the s: stale label Apr 9, 2019
@rcurtin rcurtin removed the s: stale label Apr 10, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant