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

Hartree-Fock as function minimization #6

Open
mszep opened this issue Oct 11, 2018 · 2 comments
Open

Hartree-Fock as function minimization #6

mszep opened this issue Oct 11, 2018 · 2 comments

Comments

@mszep
Copy link
Collaborator

mszep commented Oct 11, 2018

Rather than jump straight to CI, maybe it's more interesting to explore lower-hanging fruit: The possibility of framing the Hartree-Fock approximation not as a matrix eigenvalue problem, but as a constrained minimization problem. Then we could potentially use autodifferentiation to speed up the optimization.

@jarvist
Copy link
Owner

jarvist commented Oct 11, 2018

Absolutely!
I think a few Julians have already discussed this as a possibility.

The group of Aspuru-Guzik did this last year, implemented in Python. I'm not sure how far they went, I imagine they hit some limits in what you can do with the level of abstraction available.
https://arxiv.org/abs/1711.08127
https://github.com/aspuru-guzik-group/DiffiQult

@mszep
Copy link
Collaborator Author

mszep commented Oct 11, 2018

That's awesome! Definitely worth doing this first.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants