default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHongjin He
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Chenjian Pan, Chen Ling, Hongjin He
, Liqun Qi, Yanwei Xu:
A low-rank and sparse enhanced Tucker decomposition approach for tensor completion. Appl. Math. Comput. 465: 128432 (2024)- [j39]Zhiyuan Zhang, Chen Ling, Hongjin He, Liqun Qi:
A tensor train approach for internet traffic data completion. Ann. Oper. Res. 339(3): 1461-1479 (2024) - [j38]Yunfei Qu, Hongjin He, Deren Han:
A Partially Inertial Customized Douglas-Rachford Splitting Method for a Class of Structured Optimization Problems. J. Sci. Comput. 98(1): 9 (2024) - [j37]Yingxin Zhou, Hongjin He, Linan Zhang:
A Proximal Alternating Direction Method of Multipliers for DC Programming with Structured Constraints. J. Sci. Comput. 99(3): 89 (2024) - [j36]Hongjin He, Zhiyuan Zhang:
A Unified Bregman Alternating Minimization Algorithm for Generalized DC Programs with Application to Imaging. J. Sci. Comput. 101(3): 76 (2024) - [j35]Chenjian Pan, Chen Ling, Hongjin He, Liqun Qi, Yanwei Xu:
"Sparse + Low-Rank" tensor completion approach for recovering images and videos. Signal Process. Image Commun. 127: 117152 (2024) - 2023
- [j34]Kai Wang, Jintao Yu, Hongjin He:
A partially inexact generalized primal-dual hybrid gradient method for saddle point problems with bilinear couplings. J. Appl. Math. Comput. 69(5): 3693-3719 (2023) - [j33]Fan Jiang, Zhiyuan Zhang, Hongjin He:
Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes. J. Glob. Optim. 85(4): 821-846 (2023) - 2022
- [j32]Haibin Chen, Hongjin He, Yiju Wang, Guanglu Zhou:
An efficient alternating minimization method for fourth degree polynomial optimization. J. Glob. Optim. 82(1): 83-103 (2022) - [j31]Chih-Sheng Chuang, Hongjin He, Zhiyuan Zhang:
A unified Douglas-Rachford algorithm for generalized DC programming. J. Glob. Optim. 82(2): 331-349 (2022) - [j30]Hongjin He, Chen Ling, Wenhui Xie:
Tensor Completion via A Generalized Transformed Tensor T-Product Decomposition Without t-SVD. J. Sci. Comput. 93(2): 47 (2022) - 2021
- [j29]Xiaoyu Mao, Hongjin He, Hong-Kun Xu:
A partially proximal linearized alternating minimization method for finding Dantzig selectors. Comput. Appl. Math. 40(2) (2021) - [j28]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) - [j27]Xueli Bai, Hongjin He, Chen Ling, Guanglu Zhou:
A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors. Numer. Algorithms 87(3): 1301-1320 (2021) - [j26]Zhiyuan Zhang, Hongjin He:
A customized low-rank prior model for structured cartoon-texture image decomposition. Signal Process. Image Commun. 96: 116308 (2021) - [i2]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) - [j24]Kai Wang, Hongjin He:
A Double Extrapolation Primal-Dual Algorithm for Saddle Point Problems. J. Sci. Comput. 85(2): 30 (2020) - [j23]Jiawei Chen, Yiyun Wang, Hongjin He, Yibing Lv:
Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor. Numer. Algorithms 83(4): 1415-1440 (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
- [j22]Weijie Yan, Chen Ling, Liyun Ling, Hongjin He:
Generalized tensor equations with leading structured tensors. Appl. Math. Comput. 361: 311-324 (2019) - 2018
- [j21]Hongjin He, Liusheng Hou, Hong-Kun Xu:
A partially isochronous splitting algorithm for three-block separable convex minimization problems. Adv. Comput. Math. 44(4): 1091-1115 (2018) - [j20]Hongjin He, Liusheng Hou, Hong-Kun Xu:
Correction to: A partially isochronous splitting algorithm for three-block separable convex minimization problems. Adv. Comput. Math. 44(4): 1117-1118 (2018) - [j19]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
- [j18]Chen Ling, Hongjin He, Liqun Qi:
Improved approximation results on standard quartic polynomial optimization. Optim. Lett. 11(8): 1767-1782 (2017) - [j17]Kai Wang, Jitamitra Desai, Hongjin He:
A proximal partially parallel splitting method for separable convex programs. Optim. Methods Softw. 32(1): 39-68 (2017) - 2016
- [j16]Hongjin He, Deren Han:
A distributed Douglas-Rachford splitting method for multi-block convex minimization problems. Adv. Comput. Math. 42(1): 27-53 (2016) - [j15]Chen Ling, Hongjin He, Liqun Qi:
On the cone eigenvalue complementarity problem for higher-order tensors. Comput. Optim. Appl. 63(1): 143-168 (2016) - [j14]Liusheng Hou, Hongjin He, Junfeng Yang:
A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA. Comput. Optim. Appl. 63(1): 273-303 (2016) - [j13]Chen Ling, Hongjin He, Liqun Qi:
Higher-degree eigenvalue complementarity problems for tensors. Comput. Optim. Appl. 64(1): 149-176 (2016) - [j12]Hongjin He, Jitamitra Desai, Kai Wang:
A primal-dual prediction-correction algorithm for saddle point optimization. J. Glob. Optim. 66(3): 573-583 (2016) - [j11]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
- [j10]Hongjin He, Xingju Cai, Deren Han:
A fast splitting method tailored for Dantzig selector. Comput. Optim. Appl. 62(2): 347-372 (2015) - [j9]Hongjin He, Xingju Cai, Deren Han:
A class of nonlinear proximal point algorithms for variational inequality problems. Int. J. Comput. Math. 92(7): 1385-1401 (2015) - [j8]Hongjin He, Chen Ling, Hong-Kun Xu:
A Relaxed Projection Method for Split Variational Inequalities. J. Optim. Theory Appl. 166(1): 213-233 (2015) - [j7]Kai Wang, Jitamitra Desai, Hongjin He:
A note on augmented Lagrangian-based parallel splitting method. Optim. Lett. 9(6): 1199-1212 (2015) - 2014
- [j6]Chen Ling, Guifeng Wang, Hongjin He:
A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations. Appl. Math. Comput. 229: 107-122 (2014) - [j5]Deren Han, Hongjin He, Lingling Xu:
A proximal parallel splitting method for minimizing sum of convex functions with linear constraints. J. Comput. Appl. Math. 256: 36-51 (2014) - [j4]Deren Han, Hongjin He, Hai Yang, Xiaoming Yuan:
A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints. Numerische Mathematik 127(1): 167-200 (2014) - 2013
- [j3]Gang Qian, Hongjin He, Deren Han:
A Progressive equilibration Algorithm for General Market equilibrium Problems under Constraints. Asia Pac. J. Oper. Res. 30(3) (2013) - [j2]Hongjin He, Deren Han, Wenyu Sun, Yannan Chen:
A hybrid splitting method for variational inequality problems with separable structure. Optim. Methods Softw. 28(4): 725-742 (2013) - 2012
- [j1]Hongjin He, Deren Han, Zhibao Li:
Some projection methods with the BB step sizes for variational inequalities. J. Comput. Appl. Math. 236(9): 2590-2604 (2012)
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-19 21:42 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:
