default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheng-Long Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j28]Meng-Meng Zheng
, Zheng-Hai Huang, Sheng-Long Hu:
Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space. J. Glob. Optim. 84(2): 415-440 (2022)- [j27]Youyicun Lin, Sheng-Long Hu:
B-Subdifferential of the Projection onto the Generalized Spectraplex. J. Optim. Theory Appl. 192(2): 702-724 (2022) - 2021
- [j26]Sheng-Long Hu, Guoyin Li:
B-subdifferentials of the projection onto the matrix simplex. Comput. Optim. Appl. 80(3): 915-941 (2021) - 2019
- [j25]Sheng-Long Hu, Jie Wang, Zheng-Hai Huang:
An inexact augmented Lagrangian multiplier method for solving quadratic complementary problems: An adapted algorithmic framework combining specific resolution techniques. J. Comput. Appl. Math. 361: 64-78 (2019) - 2018
- [j24]Jie Wang, Sheng-Long Hu, Zheng-Hai Huang:
Solution Sets of Quadratic Complementarity Problems. J. Optim. Theory Appl. 176(1): 120-136 (2018) - [j23]Sheng-Long Hu, Jie Wang, Zheng-Hai Huang:
Error Bounds for the Solution Sets of Quadratic Complementarity Problems. J. Optim. Theory Appl. 179(3): 983-1000 (2018) - [j22]Sheng-Long Hu, Guoyin Li:
Convergence rate analysis for the higher order power method in best rank one approximations of tensors. Numerische Mathematik 140(4): 993-1031 (2018) - 2016
- [j21]Lei Yang, Zheng-Hai Huang, Sheng-Long Hu, Jiye Han:
An iterative algorithm for third-order tensor multi-rank minimization. Comput. Optim. Appl. 63(1): 169-202 (2016) - [j20]Sheng-Long Hu, Guoyin Li, Liqun Qi:
A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure. J. Optim. Theory Appl. 168(2): 446-474 (2016) - [j19]Sheng-Long Hu, Liqun Qi:
A Necessary and Sufficient Condition for Existence of a Positive Perron Vector. SIAM J. Matrix Anal. Appl. 37(4): 1747-1770 (2016) - 2015
- [j18]Xin-He Miao, Jiantao Yang, Sheng-Long Hu:
A generalized Newton method for absolute value equations associated with circular cones. Appl. Math. Comput. 269: 155-168 (2015) - [j17]Sheng-Long Hu, Liqun Qi:
The Laplacian of a uniform hypergraph. J. Comb. Optim. 29(2): 331-366 (2015) - 2014
- [j16]Sheng-Long Hu, Liqun Qi:
Convergence of a second order Markov chain. Appl. Math. Comput. 241: 183-192 (2014) - [j15]Sheng-Long Hu, Liqun Qi:
The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph. Discret. Appl. Math. 169: 140-151 (2014) - [j14]Sheng-Long Hu, Liqun Qi, Yisheng Song, Guofeng Zhang:
Geometric Measure of Quantum Entanglement for Multipartite Mixed States. Int. J. Softw. Informatics 8(3-4): 317-326 (2014) - 2013
- [j13]Sheng-Long Hu, Liqun Qi:
The E-characteristic polynomial of a tensor of dimension 2. Appl. Math. Lett. 26(2): 225-231 (2013) - [j12]Sheng-Long Hu, Guoyin Li, Liqun Qi, Yisheng Song:
Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming. J. Optim. Theory Appl. 158(3): 717-738 (2013) - [j11]Sheng-Long Hu, Zheng-Hai Huang, Chen Ling, Liqun Qi:
On determinants and eigenvalue theory of tensors. J. Symb. Comput. 50: 508-531 (2013) - [j10]Sheng-Long Hu, Zheng-Hai Huang, Liqun Qi:
Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method. Numer. Linear Algebra Appl. 20(6): 972-984 (2013) - [j9]Tie Ni, Sheng-Long Hu:
A note on quadratic convergence of a smoothing Newton algorithm for the LCP. Optim. Lett. 7(3): 519-531 (2013) - 2012
- [j8]Sheng-Long Hu, Liqun Qi:
Algebraic connectivity of an even uniform hypergraph. J. Comb. Optim. 24(4): 564-579 (2012) - [j7]Sheng-Long Hu, Zheng-Hai Huang:
Theorems of the Alternative for Inequality Systems of Real Polynomials. J. Optim. Theory Appl. 154(1): 1-16 (2012) - 2011
- [j6]Sheng-Long Hu, Zheng-Hai Huang, Qiong Zhang:
A generalized Newton method for absolute value equations associated with second order cones. J. Comput. Appl. Math. 235(5): 1490-1501 (2011) - [j5]Sheng-Long Hu, Zheng-Hai Huang:
Alternating direction method for bi-quadratic programming. J. Glob. Optim. 51(3): 429-446 (2011) - 2010
- [j4]Sheng-Long Hu, Zheng-Hai Huang, Nan Lu:
A Non-monotone Line Search Algorithm for Unconstrained Optimization. J. Sci. Comput. 42(1): 38-53 (2010) - [j3]Sheng-Long Hu, Zheng-Hai Huang:
A note on absolute value equations. Optim. Lett. 4(3): 417-424 (2010) - [j2]Sheng-Long Hu, Zheng-Hai Huang:
Polynomial time solvability of non-symmetric semidefinite programming. Oper. Res. Lett. 38(5): 358-360 (2010) - 2009
- [j1]Sheng-Long Hu, Zheng-Hai Huang, Ping Wang:
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems. Optim. Methods Softw. 24(3): 447-460 (2009)
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-10-24 20:27 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:
