default search action
Chen Ling 0001
Person information
- affiliation: Hangzhou Dianzi University, Department of Mathematics, China
- affiliation (former): Zhejiang University of Finance and Economics, School of Information, Hangzhou, China
Other persons with the same name
- Chen Ling — disambiguation page
- Chen Ling 0002 — University of Akron, Department of Mechanical Engineering, OH, USA (and 1 more)
- Chen Ling 0003
— Emory University, Department of Computer Science, Atlanta, GA, USA (and 1 more)
- Chen Ling 0004
- Chen Ling 0005
- Chen Ling 0006
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Chenjian Pan, Chen Ling, Hongjin He
A low-rank and sparse enhanced Tucker decomposition approach for tensor completion. Appl. Math. Comput. 465: 128432 (2024) - [j32]Zhiyuan Zhang
A tensor train approach for internet traffic data completion. Ann. Oper. Res. 339(3): 1461-1479 (2024) - [j31]Zhongming Chen, Chen Ling, Liqun Qi
A Regularization-Patching Dual Quaternion Optimization Method for Solving the Hand-Eye Calibration Problem. J. Optim. Theory Appl. 200(3): 1193-1215 (2024) - [j30]Chenjian Pan, Chen Ling, Hongjin He
"Sparse + Low-Rank" tensor completion approach for recovering images and videos. Signal Process. Image Commun. 127: 117152 (2024) - 2022
- [j29]Hongjin He
Tensor Completion via A Generalized Transformed Tensor T-Product Decomposition Without t-SVD. J. Sci. Comput. 93(2): 47 (2022) - [i8]Liqun Qi, David M. Alexander, Zhongming Chen, Chen Ling, Ziyan Luo:
Low Rank Approximation of Dual Complex Matrices. CoRR abs/2201.12781 (2022) - [i7]Chen Ling, Liqun Qi, Hong Yan:
Minimax principle for right eigenvalues of dual quaternion matrices and their generalized inverses. CoRR abs/2203.03161 (2022) - [i6]Zhongming Chen, Chen Ling, Liqun Qi, Hong Yan:
A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem. CoRR abs/2209.07870 (2022) - 2021
- [j28]Chen Ling, Gaohang Yu, Liqun Qi, Yanwei Xu:
T-product factorization method for internet traffic data completion with spatio-temporal regularization. Comput. Optim. Appl. 80(3): 883-913 (2021) - [j27]Hongjin He, Xueli Bai, Chen Ling, Guanglu Zhou
An index detecting algorithm for a class of TCP(A, q) equipped with nonsingular M-tensors. J. Comput. Appl. Math. 394: 113548 (2021) - [j26]Xueli Bai, Hongjin He
A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors. Numer. Algorithms 87(3): 1301-1320 (2021) - [i5]Liqun Qi, Chen Ling, Jinejie Liu, Chen Ouyang:
Orthogonal Equivalence, Singular Values and T-Rank of Third Order Tensors. CoRR abs/2103.17259 (2021) - [i4]Chen Ling, Jinjie Liu, Chen Ouyang, Liqun Qi:
ST-SVD Factorization and s-Diagonal Tensors. CoRR abs/2104.05329 (2021) - [i3]Chenjian Pan, Chen Ling, Hongjin He, Liqun Qi, Yanwei Xu:
A DCT-based Tensor Completion Approach for Recovering Color Images and Videos from Highly Undersampled Data. CoRR abs/2110.09298 (2021) - 2020
- [j25]Liyun Ling, Chen Ling, Hongjin He:
Generalized Tensor Complementarity Problems Over a Polyhedral Cone. Asia Pac. J. Oper. Res. 37(4): 2040006:1-2040006:23 (2020) - [i2]Chen Ling, Gaohang Yu, Liqun Qi, Yanwei Xu:
A Parallelizable Method for Missing Internet Traffic Tensor Data. CoRR abs/2005.09838 (2020) - [i1]Chenjian Pan, Chen Ling, Hongjin He, Liqun Qi, Yanwei Xu:
Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion. CoRR abs/2010.00359 (2020)
2010 – 2019
- 2019
- [j24]Weijie Yan, Chen Ling, Liyun Ling, Hongjin He
Generalized tensor equations with leading structured tensors. Appl. Math. Comput. 361: 311-324 (2019) - 2018
- [j23]Hongjin He, Chen Ling, Liqun Qi, Guanglu Zhou
A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with ℳ-tensors. J. Sci. Comput. 76(3): 1718-1741 (2018) - 2017
- [j22]Chen Ling, Hongjin He, Liqun Qi
Improved approximation results on standard quartic polynomial optimization. Optim. Lett. 11(8): 1767-1782 (2017) - 2016
- [j21]Chen Ling, Hongjin He, Liqun Qi
On the cone eigenvalue complementarity problem for higher-order tensors. Comput. Optim. Appl. 63(1): 143-168 (2016) - [j20]Chen Ling, Hongjin He, Liqun Qi
Higher-degree eigenvalue complementarity problems for tensors. Comput. Optim. Appl. 64(1): 149-176 (2016) - [j19]Hongjin He, Chen Ling, Hong-Kun Xu:
An Implementable Splitting Algorithm for the ℓ1-norm Regularized Split Feasibility Problem. J. Sci. Comput. 67(1): 281-298 (2016) - 2015
- [j18]Ping Jin, Chen Ling, Huifei Shen:
A smoothing Levenberg-Marquardt algorithm for semi-infinite programming. Comput. Optim. Appl. 60(3): 675-695 (2015) - [j17]Hongchao Kang, Chen Ling:
Computation of integrals with oscillatory singular factors of algebraic and logarithmic type. J. Comput. Appl. Math. 285: 72-85 (2015) - [j16]Hongjin He, Chen Ling, Hong-Kun Xu:
A Relaxed Projection Method for Split Variational Inequalities. J. Optim. Theory Appl. 166(1): 213-233 (2015) - 2014
- [j15]Chen Ling, Guifeng Wang, Hongjin He:
A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations. Appl. Math. Comput. 229: 107-122 (2014) - 2013
- [j14]Xiaojiao Tong, Chen Ling, Soon-Yi Wu, Liqun Qi
Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults. J. Glob. Optim. 55(4): 813-830 (2013) - [j13]Sheng-Long Hu, Zheng-Hai Huang, Chen Ling, Liqun Qi
On determinants and eigenvalue theory of tensors. J. Symb. Comput. 50: 508-531 (2013) - 2012
- [j12]Immanuel M. Bomze
Standard bi-quadratic optimization problems and unconstrained polynomial reformulations. J. Glob. Optim. 52(4): 663-687 (2012) - [j11]Chen Ling, Xinzhen Zhang, Liqun Qi
Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints. Numer. Linear Algebra Appl. 19(1): 113-131 (2012) - [j10]Xinzhen Zhang, Chen Ling, Liqun Qi
The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems. SIAM J. Matrix Anal. Appl. 33(3): 806-821 (2012) - 2011
- [j9]Chen Ling, Hongxia Yin, Guanglu Zhou:
A smoothing Newton-type method for solving the L2 spectral estimation problem with lower and upper bounds. Comput. Optim. Appl. 50(2): 351-378 (2011) - [j8]Xinzhen Zhang, Chen Ling, Liqun Qi
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints. J. Glob. Optim. 49(2): 293-311 (2011) - 2010
- [j7]Chen Ling, Qin Ni, Liqun Qi
A new smoothing Newton-type algorithm for semi-infinite programming. J. Glob. Optim. 47(1): 133-159 (2010)
2000 – 2009
- 2009
- [j6]Liqun Qi
A smoothing projected Newton-type algorithm for semi-infinite programming. Comput. Optim. Appl. 42(1): 1-30 (2009) - [j5]Chen Ling, Jiawang Nie, Liqun Qi
Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations. SIAM J. Optim. 20(3): 1286-1310 (2009) - 2008
- [j4]Chen Ling, Liqun Qi
The SC. Oper. Res. Lett. 36(4): 456-460 (2008) - 2006
- [j3]Hongxia Yin, Chen Ling, Liqun Qi
Convergence rate of Newton's method for L2 spectral estimation. Math. Program. 107(3): 539-546 (2006) - [j2]Qin Ni, Chen Ling, Liqun Qi
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming. SIAM J. Optim. 16(4): 1137-1154 (2006) - 2005
- [j1]Liqun Qi
Differentiability and semismoothness properties of integral functions and their applications. Math. Program. 102(2): 223-248 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: