Semidefinite relaxation algorithm for solving tensor split feasibility problem

DOI10.15926/J.CNKI.ISSN1672-6871.2020.01.014MaRDI QIDQ3306557zbMATH OpenFDO

Authors Yu-Xuan Jin, Xudong Xu, Jinling Zhao

Publication date 12 August 2020

Full work available at URL https://doi.org/10.15926/J.CNKI.ISSN1672-6871.2020.01.014

zbMATH Keywords

semidefinite programmingsemidefinite relaxationsplit feasibility problem

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• A Levenberg-Marquardt method for solving the tensor split feasibility problem
• The semi-algebraic split feasibility problem and its semi-definite relaxation
• A splitting-relaxed projection method for solving the split feasibility problem
• A novel relaxed projective method for split feasibility problems
• The relaxed inexact projection methods for the split feasibility problem

Cited in

(5)

• A Levenberg-Marquardt method for solving the tensor split feasibility problem
• The split feasibility problem with polynomials
• The semi-algebraic split feasibility problem and its semi-definite relaxation
• A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
• Semidefinite Relaxation Methods for Tensor Absolute Value Equations

This page was built for publication: Semidefinite relaxation algorithm for solving tensor split feasibility problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3306557)