Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
From MaRDI portal
Recommendations
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convergent SDP-relaxations for polynomial optimization with sparsity
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Cites work
- scientific article; zbMATH DE number 1664574 (Why is no real title available?)
- scientific article; zbMATH DE number 1047682 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- A collection of test problems for constrained global optimization algorithms
- A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Algorithm 875
- An Interior-Point Method for Semidefinite Programming
- CSDP, A C library for semidefinite programming
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Generalized Benders decomposition
- Global optimization with polynomials and the problem of moments
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Recognizing underlying sparsity in optimization
- Semidefinite programming relaxations for semialgebraic problems
- Some geometric results in semidefinite programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- The Validity of a Family of Optimization Methods
- Topics in semidefinite and interior-point methods
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(10)- A multigrid approach to SDP relaxations of sparse polynomial optimization problems
- On new classes of nonnegative symmetric tensors
- Decomposition in conic optimization with partially separable structure
- Partitioning procedure for polynomial optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Algorithm 996
- Discussion on: ``A decomposition algorithm for KYP-SDPs
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
This page was built for publication: Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987509)
