Lihong Zhi
Orcid: 0000-0001-9973-2217
According to our database1,
Lihong Zhi
authored at least 70 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
J. Symb. Comput., July, 2024
J. Symb. Comput., 2024
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
2023
VerifyRealRoots: A Matlab Package for Computing Verified Real Solutions of Polynomials Systems of Equations and Inequalities.
J. Syst. Sci. Complex., April, 2023
CoRR, 2023
Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023
2022
Improved two-step Newton's method for computing simple multiple zeros of polynomial systems.
Numer. Algorithms, 2022
A Vergleichsstellensatz of Strassen's Type for a Noncommutative Preordered Semialgebra through the Semialgebra of its Fractions.
CoRR, 2022
2021
J. Symb. Comput., 2021
2020
Math. Comput., 2020
J. Syst. Sci. Complex., 2020
2019
J. Syst. Sci. Complex., 2019
2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
2017
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017
Proceedings of the Computer Algebra in Scientific Computing - 19th International Workshop, 2017
2016
A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals.
J. Symb. Comput., 2016
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015
2014
SIAM J. Numer. Anal., 2014
Proceedings of the Symbolic-Numeric Computation 2014, 2014
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014
2013
Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one.
Theor. Comput. Sci., 2013
Computing the nearest singular univariate polynomials with given root multiplicities.
Theor. Comput. Sci., 2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013
2012
SIAM J. Numer. Anal., 2012
Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms.
J. Symb. Comput., 2012
Computing the multiplicity structure of an isolated singular solution: Case of breadth one.
J. Symb. Comput., 2012
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients.
J. Symb. Comput., 2012
Global optimization of polynomials restricted to a smooth variety using sums of squares.
J. Symb. Comput., 2012
Computing real solutions of polynomial systems via low-rank moment matrix completion.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
The minimum-rank gram matrix completion via modified fixed point continuation method.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
2010
Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions.
SIAM J. Optim., 2010
CoRR, 2010
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
Global optimization of polynomials using generalized critical values and sums of squares.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010
2009
Solving polynomial systems via symbolic-numeric reduction to geometric involutive form.
J. Symb. Comput., 2009
CoRR, 2009
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions.
Proceedings of the Symbolic Numeric Computation, 2009
2008
Theor. Comput. Sci., 2008
Approximate factorization of multivariate polynomials using singular value decomposition.
J. Symb. Comput., 2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
2007
Signal Process., 2007
Proceedings of the Symbolic-Numeric Computation, 2007
Proceedings of the Symbolic-Numeric Computation, 2007
Proceedings of the Symbolic-Numeric Computation, 2007
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).
Proceedings of the Symbolic-Numeric Computation, 2007
2006
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
2004
IEEE Trans. Signal Process., 2004
Proceedings of the Symbolic and Algebraic Computation, 2004
Proceedings of the Computer Algebra and Geometric Algebra with Applications, 2004
2003
Proceedings of the Symbolic and Algebraic Computation, 2003
2000
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000
1998
1997