default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLingchen Kong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Xin Wang, Lingchen Kong
, Liqun Wang:
Estimation of sparse covariance matrix via non-convex regularization. J. Multivar. Anal. 202: 105294 (2024)- [j38]Yang Chen, Ziyan Luo, Lingchen Kong:
Low-rank tensor regression for selection of grouped variables. J. Multivar. Anal. 203: 105339 (2024) - [c2]Yafei Wang, Bo Pan, Mei Li, Jianya Lu, Lingchen Kong, Bei Jiang, Linglong Kong:
Sample Average Approximation for Conditional Stochastic Optimization with Dependent Data. ICML 2024 - 2023
- [j37]Mei Li, Lingchen Kong, Bo Pan, Linglong Kong:
Algorithmic generalization ability of PALM for double sparse regularized regression. Appl. Intell. 53(24): 30566-30579 (2023) - [j36]Jun Sun, Lingchen Kong, Shenglong Zhou:
Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications. J. Comput. Appl. Math. 422: 114872 (2023) - [j35]Jun Sun, Lingchen Kong, Biao Qu:
A Greedy Newton-Type Method for Multiple Sparse Constraint Problem. J. Optim. Theory Appl. 196(3): 829-854 (2023) - [j34]Wentao Qu, Xianchao Xiu, Jun Sun, Lingchen Kong:
A new formulation of sparse multiple kernel k$$ k $$-means clustering and its applications. Stat. Anal. Data Min. 16(5): 436-455 (2023) - [j33]Huangyue Chen, Lingchen Kong, Wentao Qu, Xianchao Xiu:
An Enhanced Regularized Clustering Method With Adaptive Spurious Connection Detection. IEEE Signal Process. Lett. 30: 1332-1336 (2023) - 2022
- [j32]Jun Sun, Lingchen Kong, Mei Li:
Fast Algorithms for LS and LAD-Collaborative Regression. Asia Pac. J. Oper. Res. 39(6): 2250001:1-2250001:29 (2022) - [j31]Pan Shang, Lingchen Kong:
$\ell _{1}$ℓ1-Norm Quantile Regression Screening Rule via the Dual Circumscribed Sphere. IEEE Trans. Pattern Anal. Mach. Intell. 44(10): 6254-6263 (2022) - [j30]Huangyue Chen, Lingchen Kong, Yan Li:
Nonconvex clustering via ℓ0 fusion penalized regression. Pattern Recognit. 128: 108689 (2022) - [j29]Pan Shang, Lingchen Kong, Dashuai Liu:
A Safe Feature Screening Rule for Rank Lasso. IEEE Signal Process. Lett. 29: 1062-1066 (2022) - 2021
- [j28]Hongxin Zhao, Lingchen Kong, Hou-Duo Qi:
Optimal portfolio selections via ℓ 1, 2-norm regularization. Comput. Optim. Appl. 80(3): 853-881 (2021) - [j27]Pan Shang, Lingchen Kong:
Regularization Parameter Selection for the Low Rank Matrix Recovery. J. Optim. Theory Appl. 189(3): 772-792 (2021) - [j26]Yang Chen, Ziyan Luo, Lingchen Kong:
ℓ2, 0-norm based selection and estimation for multivariate generalized linear models. J. Multivar. Anal. 185: 104782 (2021) - [j25]Xianchao Xiu, Ying Yang, Lingchen Kong, Wanquan Liu:
Data-Driven Process Monitoring Using Structured Joint Sparse Canonical Correlation Analysis. IEEE Trans. Circuits Syst. II Express Briefs 68(1): 361-365 (2021) - 2020
- [j24]Xianchao Xiu, Ying Yang, Lingchen Kong, Wanquan Liu:
tSSNALM: A fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA. Appl. Math. Comput. 383: 125272 (2020) - [j23]Huangyue Chen, Lingchen Kong, Pan Shang, Shanshan Pan:
Safe feature screening rules for the regularized Huber regression. Appl. Math. Comput. 386: 125500 (2020)
2010 – 2019
- 2019
- [j22]Mei Li, Lingchen Kong:
Double fused Lasso penalized LAD for matrix regression. Appl. Math. Comput. 357: 119-138 (2019) - [j21]Xianchao Xiu, Wanquan Liu, Ling Li, Lingchen Kong:
Alternating direction method of multipliers for nonconvex fused regression problems. Comput. Stat. Data Anal. 136: 59-71 (2019) - [j20]Meijuan Shang, Yanan Liu, Lingchen Kong, Xianchao Xiu, Ying Yang:
Nonconvex mixed matrix minimization. Math. Found. Comput. 2(2): 107-126 (2019) - [j19]Huifang Wang, Lingchen Kong, Jiyuan Tao:
The linearized alternating direction method of multipliers for sparse group LAD model. Optim. Lett. 13(3): 505-525 (2019) - [j18]Lingchen Kong, Chuanqi Qi, Hou-Duo Qi:
Classical Multidimensional Scaling: A Subspace Perspective, Over-Denoising, and Outlier Detection. IEEE Trans. Signal Process. 67(14): 3842-3857 (2019) - 2018
- [j17]Xianchao Xiu, Lingchen Kong, Yan Li, Houduo Qi:
Iterative reweighted methods for \(\ell _1-\ell _p\) minimization. Comput. Optim. Appl. 70(1): 201-219 (2018) - [j16]Yuwen Gu, Jun Fan, Lingchen Kong, Shiqian Ma, Hui Zou:
ADMM for High-Dimensional Sparse Penalized Quantile Regression. Technometrics 60(3): 319-331 (2018) - 2017
- [j15]G. Q. Wang, Lingchen Kong, Jiyuan Tao, Goran Lesaja:
Erratum to: Improved Complexity Analysis of Full Nesterov-Todd Step Feasible Interior-Point Method for Symmetric Optimization. J. Optim. Theory Appl. 174(2): 636-638 (2017) - 2016
- [j14]Guo-Qiang Wang, Jiyuan Tao, Lingchen Kong:
A note on an inequality involving Jordan product in Euclidean Jordan algebras. Optim. Lett. 10(4): 731-736 (2016) - [c1]Jun Fan, Lingchen Kong, Liqun Wang, Naihua Xiu:
The Uniqueness and Greedy Method for Quadratic Compressive Sensing. DSAA 2016: 808-815 - 2015
- [j13]Guo-Qiang Wang, Lingchen Kong, Jiyuan Tao, Goran Lesaja:
Improved Complexity Analysis of Full Nesterov-Todd Step Feasible Interior-Point Method for Symmetric Optimization. J. Optim. Theory Appl. 166(2): 588-604 (2015) - 2014
- [j12]Ziyan Luo, Linxia Qin, Lingchen Kong, Naihua Xiu:
The Nonnegative Zero-Norm Minimization Under Generalized Z-Matrix Measurement. J. Optim. Theory Appl. 160(3): 854-864 (2014) - 2013
- [j11]Lingchen Kong, Naihua Xiu:
Exact Low-Rank Matrix Recovery via Nonconvex Schatten P-Minimization. Asia Pac. J. Oper. Res. 30(3) (2013) - [i3]Shenglong Zhou, Lingchen Kong, Ziyan Luo, Naihua Xiu:
New RIC Bounds via l_q-minimization with 0<q<=1 in Compressed Sensing. CoRR abs/1308.0455 (2013) - [i2]Shenglong Zhou, Naihua Xiu, Yingnan Wang, Lingchen Kong:
Exact Recovery for Sparse Signal via Weighted l_1 Minimization. CoRR abs/1312.2358 (2013) - 2012
- [j10]Linxia Qin, Naihua Xiu, Lingchen Kong, Yu Li:
Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays. Comput. Math. Methods Medicine 2012: 646045:1-646045:8 (2012) - [j9]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems. J. Optim. Theory Appl. 153(2): 357-376 (2012) - [j8]Lingchen Kong, Qingmin Meng:
A semismooth Newton method for nonlinear symmetric cone programming. Math. Methods Oper. Res. 76(2): 129-145 (2012) - [j7]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems. Math. Program. 133(1-2): 327-336 (2012) - 2011
- [j6]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming. J. Optim. Theory Appl. 148(2): 364-389 (2011) - [i1]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery. CoRR abs/1106.3276 (2011)
2000 – 2009
- 2009
- [j5]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems. Asia Pac. J. Oper. Res. 26(2): 199-233 (2009) - [j4]Linxia Qin, Lingchen Kong, Jiye Han:
Sufficiency of linear transformations on Euclidean Jordan algebras. Optim. Lett. 3(2): 265-276 (2009) - 2008
- [j3]Lingchen Kong, Naihua Xiu, Jiye Han:
The solution set structure of monotone linear complementarity problems over second-order cone. Oper. Res. Lett. 36(1): 71-76 (2008) - [j2]Lingchen Kong, Jie Sun, Naihua Xiu:
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems. SIAM J. Optim. 19(3): 1028-1047 (2008) - 2007
- [j1]Lingchen Kong, Naihua Xiu:
New smooth C-functions for symmetric cone complementarity problems. Optim. Lett. 1(4): 391-400 (2007)
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-09-04 01:25 CEST 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:
