Chen Ling

Affiliations:
  • Hangzhou Dianzi University, Department of Mathematics, China
  • Zhejiang University of Finance and Economics, School of Information, Hangzhou, China (former)


According to our database1, Chen Ling authored at least 41 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Robust tensor recovery via a nonconvex approach with ket augmentation and auto-weighted strategy.
Numer. Linear Algebra Appl., December, 2024

A tensor train approach for internet traffic data completion.
Ann. Oper. Res., August, 2024

A low-rank and sparse enhanced Tucker decomposition approach for tensor completion.
Appl. Math. Comput., March, 2024

"Sparse + Low-Rank" tensor completion approach for recovering images and videos.
Signal Process. Image Commun., 2024

A Regularization-Patching Dual Quaternion Optimization Method for Solving the Hand-Eye Calibration Problem.
J. Optim. Theory Appl., 2024

2022
Tensor Completion via A Generalized Transformed Tensor T-Product Decomposition Without t-SVD.
J. Sci. Comput., 2022

Minimax principle for right eigenvalues of dual quaternion matrices and their generalized inverses.
CoRR, 2022

Low Rank Approximation of Dual Complex Matrices.
CoRR, 2022

2021
A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors.
Numer. Algorithms, 2021

An index detecting algorithm for a class of TCP(A, q) equipped with nonsingular M-tensors.
J. Comput. Appl. Math., 2021

A DCT-based Tensor Completion Approach for Recovering Color Images and Videos from Highly Undersampled Data.
CoRR, 2021

ST-SVD Factorization and s-Diagonal Tensors.
CoRR, 2021

Orthogonal Equivalence, Singular Values and T-Rank of Third Order Tensors.
CoRR, 2021

T-product factorization method for internet traffic data completion with spatio-temporal regularization.
Comput. Optim. Appl., 2021

2020
Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion.
CoRR, 2020

A Parallelizable Method for Missing Internet Traffic Tensor Data.
CoRR, 2020

Generalized Tensor Complementarity Problems Over a Polyhedral Cone.
Asia Pac. J. Oper. Res., 2020

2019
Generalized tensor equations with leading structured tensors.
Appl. Math. Comput., 2019

2018
A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with ℳ-tensors.
J. Sci. Comput., 2018

2017
Improved approximation results on standard quartic polynomial optimization.
Optim. Lett., 2017

2016
An Implementable Splitting Algorithm for the ℓ<sub>1</sub>-norm Regularized Split Feasibility Problem.
J. Sci. Comput., 2016

Higher-degree eigenvalue complementarity problems for tensors.
Comput. Optim. Appl., 2016

On the cone eigenvalue complementarity problem for higher-order tensors.
Comput. Optim. Appl., 2016

2015
A Relaxed Projection Method for Split Variational Inequalities.
J. Optim. Theory Appl., 2015

Computation of integrals with oscillatory singular factors of algebraic and logarithmic type.
J. Comput. Appl. Math., 2015

A smoothing Levenberg-Marquardt algorithm for semi-infinite programming.
Comput. Optim. Appl., 2015

2014
A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations.
Appl. Math. Comput., 2014

2013
On determinants and eigenvalue theory of tensors.
J. Symb. Comput., 2013

Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults.
J. Glob. Optim., 2013

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

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

A smoothing Newton-type method for solving the <i>L</i><sub>2</sub> spectral estimation problem with lower and upper bounds.
Comput. Optim. Appl., 2011

2010
A new smoothing Newton-type algorithm for semi-infinite programming.
J. Glob. Optim., 2010

2009
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations.
SIAM J. Optim., 2009

A smoothing projected Newton-type algorithm for semi-infinite programming.
Comput. Optim. Appl., 2009

2008
The SC.
Oper. Res. Lett., 2008

2006
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming.
SIAM J. Optim., 2006

Convergence rate of Newton's method for <i>L</i><sub>2</sub> spectral estimation.
Math. Program., 2006

2005
Differentiability and semismoothness properties of integral functions and their applications.
Math. Program., 2005


  Loading...