Xinzhen Zhang

Orcid: 0000-0001-7498-6616

According to our database1, Xinzhen Zhang authored at least 33 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Tensor Factorization-Based Method for Tensor Completion with Spatio-temporal Characterization.
J. Optim. Theory Appl., October, 2023

Copositivity of Three-Dimensional Symmetric Tensors.
Asia Pac. J. Oper. Res., June, 2023

Low Tucker rank tensor completion using a symmetric block coordinate descent method.
Numer. Linear Algebra Appl., May, 2023

T-product factorization based method for matrix and tensor completion problems.
Comput. Optim. Appl., April, 2023

Deterministic dynamic Stackelberg games: Time-consistent open-loop solution.
Autom., February, 2023

2022
A Nash-Type Fictitious Game Framework to Time-Inconsistent Stochastic Control Problems.
SIAM J. Control. Optim., 2022

Quaternion Matrix Optimization: Motivation and Analysis.
J. Optim. Theory Appl., 2022

Optimal Sizing and Pricing of Renewable Power to Ammonia Systems Considering the Limited Flexibility of Ammonia Synthesis.
CoRR, 2022

A smoothing proximal gradient algorithm for matrix rank minimization problem.
Comput. Optim. Appl., 2022

Low rank matrix recovery with impulsive noise.
Appl. Math. Lett., 2022

An SDP relaxation method for perron pairs of a nonnegative tensor.
Appl. Math. Comput., 2022

2021
Triple Decomposition and Tensor Recovery of Third Order Tensors.
SIAM J. Matrix Anal. Appl., 2021

A Barzilai-Borwein Gradient Algorithm for Spatio-Temporal Internet Traffic Data Completion via Tensor Triple Decomposition.
J. Sci. Comput., 2021

A semidefinite relaxation method for second-order cone tensor eigenvalue complementarity problems.
J. Glob. Optim., 2021

2020
A Tensor Rank Theory, Full Rank Tensors and The Sub-Full-Rank Property.
CoRR, 2020

SDP relaxation algorithms for $\mathbf {P}(\mathbf {P}_0)$-tensor detection.
Comput. Optim. Appl., 2020

A semidefinite relaxation method for second-order cone polynomial complementarity problems.
Comput. Optim. Appl., 2020

Adaptive Prior Patch Size Based Sparse-View CT Reconstruction Algorithm.
Proceedings of the 17th IEEE International Symposium on Biomedical Imaging, 2020

Previous-stage-based ROI Reconstruction Method for Ultra-low-dose CT Angiography.
Proceedings of the 20th IEEE International Conference on Bioinformatics and Bioengineering, 2020

2019
Calculating Entanglement Eigenvalues for Nonsymmetric Quantum Pure States Based on the Jacobian Semidefinite Programming Relaxation Method.
J. Optim. Theory Appl., 2019

Biquadratic Tensors, Biquadratic Decomposition and Norms of Biquadratic Tensors.
CoRR, 2019

Nuclear Norm and Spectral Norm of Tensor Product.
CoRR, 2019

2018
A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors.
SIAM J. Optim., 2018

Real eigenvalues of nonsymmetric tensors.
Comput. Optim. Appl., 2018

2016
Comon's Conjecture, Rank Decomposition, and Symmetric Rank Decomposition of Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2016

Positive Maps and Separable Matrices.
SIAM J. Optim., 2016

2012
The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems.
SIAM J. Matrix Anal. Appl., 2012

Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
Numer. Linear Algebra Appl., 2012

The cubic spherical optimization problems.
Math. Comput., 2012

Standard bi-quadratic optimization problems and unconstrained polynomial reformulations.
J. Glob. Optim., 2012

2011
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints.
J. Glob. Optim., 2011

2009
A practical method for computing the largest <i>M</i>-eigenvalue of a fourth-order partially symmetric tensor.
Numer. Linear Algebra Appl., 2009

2005
A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone.
Appl. Math. Comput., 2005


  Loading...