Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
From MaRDI portal
Publication:2079694
DOI10.1007/S10898-022-01148-WzbMATH Open1502.65036OpenAlexW4220927670MaRDI QIDQ2079694FDOQ2079694
Meng-Meng Zheng, Shenglong Hu, Zhenghai 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- A theory for multiresolution signal decomposition: the wavelet representation
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Factorization strategies for third-order tensors
- Global optimization with polynomials and the problem of moments
- Toeplitz and Circulant Matrices: A Review
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Semidefinite programming relaxations for semialgebraic problems
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Sum of squares method for sensor network localization
- Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Handbook on semidefinite, conic and polynomial optimization
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Approximation Methods for Polynomial Optimization
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- A bounded degree SOS hierarchy for polynomial optimization
- Codes with bounded synchronization delay
- A possible code in the genetic code
- 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
Cited In (1)
Uses Software
This page was built for publication: Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079694)
