Decomposition of arrow type positive semidefinite matrices with application to topology optimization
DOI10.1007/s10107-020-01526-wzbMath1478.90080arXiv1911.09412OpenAlexW2990431365MaRDI QIDQ2235142
Publication date: 20 October 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.09412
domain decompositionsemidefinite optimizationchordal graphstopology optimizationpositive semidefinite matrices
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Semidefinite programming (90C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Compliance or weight optimization in solid mechanics (74P05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Positive definite completions of partial Hermitian matrices
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
- Positive semidefinite matrices with a given sparsity pattern
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- A Finite Element Analysis of Optimal Variable Thickness Sheets
- On the existence of convex decompositions of partially separable functions
- Multidisciplinary Free Material Optimization
This page was built for publication: Decomposition of arrow type positive semidefinite matrices with application to topology optimization