default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLihong Zhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Kisun Lee, Nan Li
, Lihong Zhi:
Two-step Newton's method for deflation-one singular zeros of analytic systems. J. Symb. Comput. 123: 102278 (2024)- [j29]Nan Li, Zijia Li, Zhi-Hong Yang, Lihong Zhi:
The integral closure of a primary ideal is not always primary. J. Symb. Comput. 125: 102315 (2024) - [c33]Hao Liang, Jingyu Lu, Manolis C. Tsakiris, Lihong Zhi:
Unlabeled Sensing Using Rank-One Moment Matrix Completion. ISSAC 2024: 46-55 - [c32]Zihao Dai, Zijia Li, Zhi-Hong Yang, Lihong Zhi:
Whitney Stratification of Algebraic Boundaries of Convex Semi-algebraic Sets. ISSAC 2024: 299-306 - [i9]Zihao Dai, Zijia Li, Zhi-Hong Yang, Lihong Zhi:
Whitney Stratification of Algebraic Boundaries of Convex Semi-algebraic Sets. CoRR abs/2406.04681 (2024) - 2023
- [j28]Zhengfeng Yang, Hanrui Zhao, Lihong Zhi:
VerifyRealRoots: A Matlab Package for Computing Verified Real Solutions of Polynomials Systems of Equations and Inequalities. J. Syst. Sci. Complex. 36(2): 866-883 (2023) - [c31]Jianting Yang, Ke Ye, Lihong Zhi:
Lower Bounds of Functions on Finite Abelian Groups. COCOON (2) 2023: 157-170 - [c30]Sizhuo Yan, Jianting Yang, Tianshi Yu, Lihong Zhi:
A Characterization of Perfect Strategies for Mirror Games. ISSAC 2023: 545-554 - [i8]Hao Liang, Jingyu Lu, Manolis C. Tsakiris, Lihong Zhi:
A Field-Theoretic Approach to Unlabeled Sensing. CoRR abs/2303.01175 (2023) - [i7]Kisun Lee, Nan Li, Lihong Zhi:
Two-step Newton's method for deflation-one singular zeros of analytic systems. CoRR abs/2305.10803 (2023) - [i6]Hao Wu, Qiuye Wang, Bai Xue, Naijun Zhan, Lihong Zhi, Zhi-Hong Yang:
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming. CoRR abs/2310.11133 (2023) - 2022
- [j27]Nan Li, Lihong Zhi:
Improved two-step Newton's method for computing simple multiple zeros of polynomial systems. Numer. Algorithms 91(1): 19-50 (2022) - [e3]Marc Moreno Maza, Lihong Zhi:
ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4 - 7, 2022. ACM 2022, ISBN 978-1-4503-8688-3 [contents] - [i5]Tao Zheng, Lihong Zhi:
A Vergleichsstellensatz of Strassen's Type for a Noncommutative Preordered Semialgebra through the Semialgebra of its Fractions. CoRR abs/2204.02577 (2022) - 2021
- [j26]Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
Computing real radicals and S-radicals of polynomial systems. J. Symb. Comput. 102: 259-278 (2021) - 2020
- [j25]Chu Wang, Lihong Zhi:
Lifts of Non-Compact Convex Sets and Cone Factorizations. J. Syst. Sci. Complex. 33(5): 1632-1655 (2020) - [j24]Zhiwei Hao, Wenrong Jiang, Nan Li, Lihong Zhi:
On isolation of simple multiple zeros and clusters of zeros of polynomial systems. Math. Comput. 89(322): 879-909 (2020) - [e2]Ioannis Z. Emiris, Lihong Zhi:
ISSAC '20: International Symposium on Symbolic and Algebraic Computation, Kalamata, Greece, July 20-23, 2020. ACM 2020, ISBN 978-1-4503-7100-1 [contents] - [i4]Jiawang Nie, Ke Ye, Lihong Zhi:
Symmetric Tensor Decompositions On Varieties. CoRR abs/2003.09822 (2020)
2010 – 2019
- 2019
- [j23]Chu Wang, Zhi-Hong Yang, Lihong Zhi:
Global Optimization of Polynomials over Real Algebraic Sets. J. Syst. Sci. Complex. 32(1): 158-184 (2019) - [i3]Qiuye Wang, Lihong Zhi, Naijun Zhan, Bai Xue, Zhi-Hong Yang:
Synthesizing More Expressive Invariants by Semidefinite Programming. CoRR abs/1903.04668 (2019) - 2018
- [c29]Mohab Safey El Din, Zhi-Hong Yang, Lihong Zhi:
On the Complexity of Computing Real Radicals of Polynomial Systems. ISSAC 2018: 351-358 - 2017
- [j22]Jan Verschelde, Stephen M. Watt, Lihong Zhi:
TCS SNC Preface. Theor. Comput. Sci. 681: 1-2 (2017) - [c28]Lihong Zhi:
Computing Multiple Zeros of Polynomial Systems: Case of Breadth One (Invited Talk). CASC 2017: 392-405 - [c27]Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi:
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. ISSAC 2017: 125-132 - 2016
- [j21]Yue Ma, Chu Wang, Lihong Zhi:
A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals. J. Symb. Comput. 72: 1-20 (2016) - [c26]Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi:
Numerical Sparsity Determination and Early Termination. ISSAC 2016: 247-254 - 2015
- [j20]Feng Guo, Chu Wang, Lihong Zhi:
Semidefinite Representations of Noncompact Convex Sets. SIAM J. Optim. 25(1): 377-395 (2015) - [c25]Lihong Zhi:
Optimization Problems over Noncompact Semialgebraic Sets. ISSAC 2015: 13-14 - [c24]Feng Guo, Mohab Safey El Din, Chu Wang, Lihong Zhi:
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety. ISSAC 2015: 205-212 - 2014
- [j19]Nan Li, Lihong Zhi:
Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems. SIAM J. Numer. Anal. 52(4): 1623-1640 (2014) - [c23]Lihong Zhi:
Symbolic-numeric algorithms for computing validated results. ISSAC 2014: 25-26 - [c22]Feng Guo, Chu Wang, Lihong Zhi:
Optimizing a linear function over a noncompact real algebraic variety. SNC 2014: 39-40 - [e1]Lihong Zhi, Stephen M. Watt:
Symbolic-Numeric Computation 2014, SNC '14, Shanghai, China, July 28-31, 2014. ACM 2014, ISBN 978-1-4503-2963-7 [contents] - 2013
- [j18]Ilias S. Kotsireas, Bernard Mourrain, Victor Y. Pan, Lihong Zhi:
Preface. Theor. Comput. Sci. 479: 1-3 (2013) - [j17]Zijia Li, Lihong Zhi:
Computing the nearest singular univariate polynomials with given root multiplicities. Theor. Comput. Sci. 479: 150-162 (2013) - [j16]Nan Li, Lihong Zhi:
Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one. Theor. Comput. Sci. 479: 163-173 (2013) - [c21]Qingdong Guo, Mohab Safey El Din, Lihong Zhi:
Computing rational solutions of linear matrix inequalities. ISSAC 2013: 197-204 - [c20]Zhengfeng Yang, Lihong Zhi, Yijun Zhu:
Verified error bounds for real solutions of positive-dimensional polynomial systems. ISSAC 2013: 371-378 - 2012
- [j15]Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi:
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J. Symb. Comput. 47(1): 1-15 (2012) - [j14]Xiaoli Wu, Lihong Zhi:
Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms. J. Symb. Comput. 47(3): 227-238 (2012) - [j13]Aurélien Greuet, Feng Guo, Mohab Safey El Din, Lihong Zhi:
Global optimization of polynomials restricted to a smooth variety using sums of squares. J. Symb. Comput. 47(5): 503-518 (2012) - [j12]Nan Li, Lihong Zhi:
Computing the multiplicity structure of an isolated singular solution: Case of breadth one. J. Symb. Comput. 47(6): 700-710 (2012) - [j11]Nan Li, Lihong Zhi:
Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One. SIAM J. Numer. Anal. 50(1): 354-372 (2012) - [c19]Feng Guo, Erich L. Kaltofen, Lihong Zhi:
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC 2012: 195-202 - [c18]Yue Ma, Lihong Zhi:
Computing real solutions of polynomial systems via low-rank moment matrix completion. ISSAC 2012: 249-256 - 2011
- [c17]Yue Ma, Lihong Zhi:
The minimum-rank gram matrix completion via modified fixed point continuation method. ISSAC 2011: 241-248 - 2010
- [j10]Mohab Safey El Din, Lihong Zhi:
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. SIAM J. Optim. 20(6): 2876-2889 (2010) - [c16]Feng Guo, Mohab Safey El Din, Lihong Zhi:
Global optimization of polynomials using generalized critical values and sums of squares. ISSAC 2010: 107-114 - [c15]Zijia Li, Zhengfeng Yang, Lihong Zhi:
Blind image deconvolution via fast approximate GCD. ISSAC 2010: 155-162 - [c14]Sharon Hutton, Erich L. Kaltofen, Lihong Zhi:
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC 2010: 227-234 - [i2]Yue Ma, Lihong Zhi:
The Minimum-Rank Gram Matrix Completion via Fixed Point Continuation Method. CoRR abs/1011.6495 (2010)
2000 – 2009
- 2009
- [j9]Greg Reid, Lihong Zhi:
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form. J. Symb. Comput. 44(3): 280-291 (2009) - [c13]Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. SNC 2009: 65-70 - [i1]Mohab Safey El Din, Lihong Zhi:
Computing rational points in convex semi-algebraic sets and SOS decompositions. CoRR abs/0910.2973 (2009) - 2008
- [j8]Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi:
Approximate factorization of multivariate polynomials using singular value decomposition. J. Symb. Comput. 43(5): 359-376 (2008) - [j7]Bin Li, Jiawang Nie, Lihong Zhi:
Approximate GCDs of polynomials and sparse SOS relaxations. Theor. Comput. Sci. 409(2): 200-210 (2008) - [c12]Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi:
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. ISSAC 2008: 155-164 - [c11]Xiaoli Wu, Lihong Zhi:
Computing the multiplicity structure from geometric involutive form. ISSAC 2008: 325-332 - 2007
- [j6]Dongming Wang, Lihong Zhi:
Foreword. Math. Comput. Sci. 1(2): 209-210 (2007) - [j5]Dongxia Sun, Lihong Zhi:
Structured Low Rank Approximation of a Bezout Matrix. Math. Comput. Sci. 1(2): 427-437 (2007) - [j4]Bingyu Li, Zhuojun Liu, Lihong Zhi:
A fast algorithm for solving the Sylvester structured total least squares problem. Signal Process. 87(10): 2313-2319 (2007) - [c10]Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17 - [c9]Lihong Zhi:
Numerical optimization in hybrid symbolic-numeric computation. SNC 2007: 33-35 - [c8]Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi:
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC 2007: 203-204 - [c7]Bin Li, Jiawang Nie, Lihong Zhi:
Approximate GCDs of polynomials and SOS relaxation. SNC 2007: 205-206 - 2006
- [c6]Erich L. Kaltofen, Lihong Zhi:
Hybrid symbolic-numeric computation. ISSAC 2006: 7 - [c5]Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC 2006: 169-176 - 2004
- [j3]Robert M. Corless, Stephen M. Watt, Lihong Zhi:
QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Signal Process. 52(12): 3394-3402 (2004) - [c4]Gregory J. Reid, Jianliang Tang, Jianping Yu, Lihong Zhi:
Hybrid Method for Solving New Pose Estimation Equation System. IWMM/GIAE 2004: 44-55 - [c3]Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi:
Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174 - 2003
- [c2]Gregory J. Reid, Jianliang Tang, Lihong Zhi:
A complete symbolic-numeric linear method for camera pose determination. ISSAC 2003: 215-223 - 2000
- [c1]Yuzhen Huang, Wenda Wu, Hans J. Stetter, Lihong Zhi:
Pseudofactors of multivariate polynomials. ISSAC 2000: 161-168
1990 – 1999
- 1998
- [j2]Lihong Zhi, Wenda Wu:
Nearest Singular Polynomials. J. Symb. Comput. 26(6): 667-675 (1998) - 1997
- [j1]Lihong Zhi:
Optimal algorithm for algebraic factoring. J. Comput. Sci. Technol. 12(1): 1-9 (1997)
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-08-05 21:13 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:
