Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
type: Item
instance of: scholarly article
title: Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
zbMATH Open document ID: 1502.65036
author: Meng-Meng Zheng
author: Zhenghai Huang
author: Shenglong Hu
published in: Journal of Global Optimization
publication date: 2022-09-30T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 7595235
zbMATH Keywords: unconstrained polynomial optimization problem
zbMATH Keywords: block-circulant structure
zbMATH Keywords: Lasserre's relaxation
zbMATH Keywords: semidefinite program
describes a project that uses: SeDuMi
describes a project that uses: SDPNAL+
describes a project that uses: SDPT3
describes a project that uses: GloptiPoly
MaRDI profile type: Publication
full work available at URL: s10898-022-01148-w
OpenAlex ID: W4220927670
cites work: Sum of squares method for sensor network localization
cites work: Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
cites work: Approximation Methods for Polynomial Optimization
cites work: Handbook on semidefinite, conic and polynomial optimization
cites work: Q4496025
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: Global optimization with polynomials and the problem of moments
cites work: The \(\mathcal A\)-truncated \(K\)-moment problem
cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly
cites work: Q4324980
cites work: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
cites work: Regularization methods for SDP relaxations in large-scale polynomial optimization
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
cites work: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
cites work: A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
cites work: A bounded degree SOS hierarchy for polynomial optimization
cites work: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
cites work: T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
cites work: Q3208805
cites work: Factorization strategies for third-order tensors
cites work: Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q4917542
cites work: Toeplitz and Circulant Matrices: A Review
cites work: Block circulant matrices and applications in free vibration analysis of cyclically repetitive structures
cites work: Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
cites work: A theory for multiresolution signal decomposition: the wavelet representation
cites work: Discrete biorthogonal wavelet transforms as block circulant matrices
cites work: Codes with bounded synchronization delay
cites work: A possible code in the genetic code
cites work: Q3776003
DOI: 10.1007/S10898-022-01148-W
description: scientific article; zbMATH DE number 7595235