Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
From MaRDI portal
Publication:2079694
DOI10.1007/s10898-022-01148-wzbMath1502.65036OpenAlexW4220927670MaRDI QIDQ2079694
Meng-Meng Zheng, Sheng-Long Hu, Zheng-Hai Huang
Publication date: 30 September 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01148-w
semidefinite programLasserre's relaxationblock-circulant structureunconstrained polynomial optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
- Factorization strategies for third-order tensors
- Handbook on semidefinite, conic and polynomial optimization
- Sum of squares method for sensor network localization
- Semidefinite programming relaxations for semialgebraic problems
- Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
- Discrete biorthogonal wavelet transforms as block circulant matrices
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- A bounded degree SOS hierarchy for polynomial optimization
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- A theory for multiresolution signal decomposition: the wavelet representation
- Toeplitz and Circulant Matrices: A Review
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A possible code in the genetic code
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Approximation Methods for Polynomial Optimization
- Codes with bounded synchronization delay
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
