Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
From MaRDI portal
Publication:2079694
Recommendations
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- On global optimizations with polynomials
- Global optimization with polynomials and the problem of moments
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- Maximum block improvement and polynomial optimization
Cites work
- A bounded degree SOS hierarchy for polynomial optimization
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- 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.
- A theory for multiresolution signal decomposition: the wavelet representation
- Approximation Methods for Polynomial Optimization
- Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
- Codes with bounded synchronization delay
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Discrete biorthogonal wavelet transforms as block circulant matrices
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Factorization strategies for third-order tensors
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Global optimization with polynomials and the problem of moments
- Handbook on semidefinite, conic and polynomial optimization
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- scientific article; zbMATH DE number 4036424 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite programming relaxations for semialgebraic problems
- Sum of squares method for sensor network localization
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- The \(\mathcal A\)-truncated \(K\)-moment problem
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
- Toeplitz and Circulant Matrices: A Review
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(1)
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)
