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

Chordal decomposition + barrier method + augmented Lagrangian algorithm for large scale buckling constraints #92

Open
mohamed82008 opened this issue Dec 1, 2021 · 0 comments

Comments

@mohamed82008
Copy link
Member

Now that we have a differentiable assembly operator, we can use to do chordal decomposition by breaking down the large scale sparse SDP constraint into a bunch of small SDP constraints. We still need an equality constraint to specify that the relationship between the large scale sparse matrix K + c * Ksigma == assembleK(Ms) where Ms is the vector of small matrix decision variables of the same size as the element stiffness matrices, i.e. Ms[1] is of size ndofs_per_element x ndofs_per_element. With this formulation, we can then use SDPBarrierAlg of a PercivalAlg to solve the problem efficiently.

@mohamed82008 mohamed82008 changed the title Chordal decomposition and interior point + augmented Lagrangian algorithm for large scale buckling constraints Chordal decomposition + barrier method + augmented Lagrangian algorithm for large scale buckling constraints Dec 1, 2021
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

1 participant