Term-sparse polynomial optimization for the design of frame structures
From MaRDI portal
Cites work
- A biased random-key genetic algorithm for the chordal completion problem
- A bounded degree SOS hierarchy for polynomial optimization
- A hierarchy of spectral relaxations for polynomial optimization
- Algorithm 837
- An introduction to polynomial and semi-algebraic optimization
- Coercive Polynomials and Their Newton Polytopes
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Decomposition of arrow type positive semidefinite matrices with application to topology optimization
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Extremal psd forms with few terms
- Global optimization with polynomials and the problem of moments
- Minimal triangulations of graphs: a survey
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- Scalable semidefinite programming
- Solution of the truncated complex moment problem for flat data
- Sparse Polynomial Optimization
- Structural Topology Optimization with Eigenvalues
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Topology optimization of frame structures with flexible joints
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
Cited in
(1)
This page was built for publication: Term-sparse polynomial optimization for the design of frame structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309420)