T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
DOI10.1007/S10589-024-00582-8MaRDI QIDQ6606854
Hiroki Marumo, Makoto Yamashita, Sunyoung Kim
Publication date: 17 September 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
numerical efficiencythird-order tensorsconstrained polynomial optimizationblock-diagonal structured SDP relaxationconvergence to the optimal valueT-SDP relaxation
Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A collection of test problems for constrained global optimization algorithms
- Multivariate polynomial minimization and its application in signal processing
- Semidefinite programming relaxations for semialgebraic problems
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- On the use of homogeneous polynomials to develop anisotropic yield functions with applications to sheet forming
- Global optimization with polynomials and the problem of moments
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Adaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- An Order-$p$ Tensor Factorization with Applications in Imaging
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- 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
- Blind constant modulus equalization via convex optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- A Correlatively Sparse Lagrange Multiplier Expression Relaxation for Polynomial Optimization
This page was built for publication: T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606854)
