default search action
Shenglong Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Jiaqing Fan, Shenglong Hu, Long Wang, Kaihua Zhang, Bo Liu:
Dual temporal memory network with high-order spatio-temporal graph learning for video object segmentation. Image Vis. Comput. 150: 105208 (2024) - [j10]Shenglong Hu
, Zhifang Yan:
Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere. J. Optim. Theory Appl. 201(1): 378-395 (2024) - 2023
- [j9]Shenglong Hu, Yong Wang
A DCA-Newton method for quartic minimization over the sphere. Adv. Comput. Math. 49(4): 53 (2023) - [j8]Xueshuang Ma, Shenglong Hu, Jie Wang:
Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering. J. Comput. Appl. Math. 423: 114947 (2023) - [j7]Shenglong Hu, Ke Ye
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations. Math. Program. 199(1): 1305-1364 (2023) - [i6]Yang Wu, Shenglong Hu, Huihui Song, Kaihua Zhang, Bo Liu, Dong Liu:
Towards Open-World Co-Salient Object Detection with Generative Uncertainty-aware Group Selective Exchange-Masking. CoRR abs/2310.10264 (2023) - 2022
- [j6]Youyicun Lin, Shenglong Hu:
B-Subdifferentials of the Projection onto the Generalized Simplex. Asia Pac. J. Oper. Res. 39(2): 2150020:1-2150020:15 (2022) - [j5]Wenxin Du, Shenglong Hu, Youyicun Lin, Jie Wang:
A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation. Asia Pac. J. Oper. Res. 39(6): 2250003:1-2250003:12 (2022) - [i5]Ke Ye, Shenglong Hu:
When geometry meets optimization theory: partially orthogonal tensors. CoRR abs/2201.04824 (2022) - 2021
- [i4]Shenglong Hu:
Nondegeneracy of eigenvectors and singular vector tuples of tensors. CoRR abs/2104.05900 (2021) - 2020
- [j4]Shenglong Hu:
Bounds on strongly orthogonal ranks of tensors. Appl. Math. Comput. 365 (2020) - [j3]Shenglong Hu:
An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors. Comput. Optim. Appl. 75(3): 701-737 (2020)
2010 – 2019
- 2019
- [j2]Shenglong Hu, Defeng Sun
Best Nonnegative Rank-One Approximations of Tensors. SIAM J. Matrix Anal. Appl. 40(4): 1527-1554 (2019) - [j1]Shenglong Hu
An Analytical Method for Calculating the Natural Frequencies of a Motor Considering Orthotropic Material Parameters. IEEE Trans. Ind. Electron. 66(10): 7520-7528 (2019) - [i3]Liqun Qi, Shenglong Hu:
Spectral Norm and Nuclear Norm of a Third Order Tensor. CoRR abs/1909.01529 (2019) - [i2]Liqun Qi, Shenglong Hu, Xinzhen Zhang:
Nuclear Norm and Spectral Norm of Tensor Product. CoRR abs/1909.10942 (2019) - [i1]Liqun Qi, Shenglong Hu, Xinzhen Zhang:
Biquadratic Tensors, Biquadratic Decomposition and Norms of Biquadratic Tensors. CoRR abs/1909.13451 (2019)
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-18 20:46 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: