T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
From MaRDI portal
Publication:2026772
DOI10.1007/s10589-020-00231-wzbMath1465.15031arXiv2006.11151OpenAlexW3090748864WikidataQ114227031 ScholiaQ114227031MaRDI QIDQ2026772
Meng-Meng Zheng, Yong Wang, Zheng-Hai Huang
Publication date: 20 May 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.11151
polynomial optimizationT-positive semidefinitenessT-productT-semidefinite coneT-semidefinite programming
Related Items (10)
T-product tensors. II: Tail bounds for sums of random T-product tensors ⋮ An orthogonal equivalence theorem for third order tensors ⋮ Perron-Frobenius type theorem for nonnegative tubal matrices in the sense of \(t\)-product ⋮ On some tensor inequalities based on the t-product ⋮ Enhancing low-rank tensor completion via first-order and second-order total variation regularizations ⋮ A fixed point iterative method for third-order tensor linear complementarity problems ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space ⋮ Hot-SVD: higher order t-singular value decomposition for tensors based on tensor-tensor product ⋮ Generalized T-Product Tensor Bernstein Bounds ⋮ T-square tensors. I: Inequalities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Calculus on normed vector spaces
- Factorization strategies for third-order tensors
- A tensor-based dictionary learning approach to tomographic image reconstruction
- Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery
- Dual quadratic estimates in polynomial and Boolean programming
- Semidefinite programming relaxations for semialgebraic problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- On unifying multi-view self-representations for clustering by tensor multi-rank minimization
- T-Jordan canonical form and T-Drazin inverse based on the T-product
- Lectures on Modern Convex Optimization
- Facial Recognition Using Tensor-Tensor Decompositions
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- The tensor t‐function: A definition for functions of third‐order tensors
- Semidefinite optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Spectral Bundle Method for Semidefinite Programming
- Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography
- Nuclear norm of higher-order tensors
- Tensor Factorization for Low-Rank Tensor Completion
- Moving Object Detection Using Tensor-Based Low-Rank and Saliently Fused-Sparse Decomposition
- Polar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit
- Exact Tensor Completion Using t-SVD
- Semidefinite Programming
- An Order-$p$ Tensor Factorization with Applications in Imaging
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Tensor Analysis
- Symmetric Tensor Nuclear Norms
- Third-order tensors as linear operators on a space of matrices
- An iterative algorithm for third-order tensor multi-rank minimization
This page was built for publication: T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
