Lihong Zhi

J. Symb. Comput., July, 2024

2023

VerifyRealRoots: A Matlab Package for Computing Verified Real Solutions of Polynomials Systems of Equations and Inequalities.

[BibT_eX]

[DOI]

Hanrui Zhao

J. Syst. Sci. Complex., April, 2023

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming.

[BibT_eX]

[DOI]

CoRR, 2023

A Field-Theoretic Approach to Unlabeled Sensing.

[BibT_eX]

[DOI]

CoRR, 2023

A Characterization of Perfect Strategies for Mirror Games.

[BibT_eX]

[DOI]

Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, 2023

Lower Bounds of Functions on Finite Abelian Groups.

[BibT_eX]

[DOI]

Jianting Yang

Ke Ye

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.

[BibT_eX]

[DOI]

Numer. Algorithms, 2022

A Vergleichsstellensatz of Strassen's Type for a Noncommutative Preordered Semialgebra through the Semialgebra of its Fractions.

[BibT_eX]

[DOI]

Tao Zheng

CoRR, 2022

2021

Computing real radicals and <i>S</i>-radicals of polynomial systems.

[BibT_eX]

[DOI]

Zhi-Hong Yang

J. Symb. Comput., 2021

2020

On isolation of simple multiple zeros and clusters of zeros of polynomial systems.

[BibT_eX]

[DOI]

Math. Comput., 2020

Lifts of Non-Compact Convex Sets and Cone Factorizations.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2020

Symmetric Tensor Decompositions On Varieties.

[BibT_eX]

[DOI]

Jiawang Nie

Ke Ye

CoRR, 2020

2019

Global Optimization of Polynomials over Real Algebraic Sets.

[BibT_eX]

[DOI]

Zhi-Hong Yang

J. Syst. Sci. Complex., 2019

Synthesizing More Expressive Invariants by Semidefinite Programming.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On the Complexity of Computing Real Radicals of Polynomial Systems.

[BibT_eX]

[DOI]

Zhi-Hong Yang

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

TCS SNC Preface.

[BibT_eX]

[DOI]

Jan Verschelde

Stephen M. Watt

Theor. Comput. Sci., 2017

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Computing Multiple Zeros of Polynomial Systems: Case of Breadth One (Invited Talk).

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Numerical Sparsity Determination and Early Termination.

[BibT_eX]

[DOI]

Zhiwei Hao

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015

Semidefinite Representations of Noncompact Convex Sets.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

Optimization Problems over Noncompact Semialgebraic Sets.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2014

Optimizing a linear function over a noncompact real algebraic variety.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation 2014, 2014

Symbolic-numeric algorithms for computing validated results.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Computing the nearest singular univariate polynomials with given root multiplicities.

[BibT_eX]

[DOI]

Zijia Li

Theor. Comput. Sci., 2013

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Verified error bounds for real solutions of positive-dimensional polynomial systems.

[BibT_eX]

[DOI]

Yijun Zhu

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Computing rational solutions of linear matrix inequalities.

[BibT_eX]

[DOI]

Qingdong Guo

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One.

[BibT_eX]

[DOI]

SIAM J. Numer. Anal., 2012

Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms.

[BibT_eX]

[DOI]

Xiaoli Wu

J. Symb. Comput., 2012

Computing the multiplicity structure of an isolated singular solution: Case of breadth one.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Global optimization of polynomials restricted to a smooth variety using sums of squares.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Computing real solutions of polynomial systems via low-rank moment matrix completion.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

The minimum-rank gram matrix completion via modified fixed point continuation method.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

The Minimum-Rank Gram Matrix Completion via Fixed Point Continuation Method

[BibT_eX]

[DOI]

CoRR, 2010

Blind image deconvolution via fast approximate GCD.

[BibT_eX]

[DOI]

Zijia Li

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.

[BibT_eX]

[DOI]

Sharon Hutton

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Global optimization of polynomials using generalized critical values and sums of squares.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Solving polynomial systems via symbolic-numeric reduction to geometric involutive form.

[BibT_eX]

[DOI]

Greg Reid

J. Symb. Comput., 2009

Computing rational points in convex semi-algebraic sets and SOS decompositions

[BibT_eX]

[DOI]

CoRR, 2009

A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic Numeric Computation, 2009

2008

Approximate GCDs of polynomials and sparse SOS relaxations.

[BibT_eX]

[DOI]

Bin Li

Jiawang Nie

Theor. Comput. Sci., 2008

Approximate factorization of multivariate polynomials using singular value decomposition.

[BibT_eX]

[DOI]

J. Symb. Comput., 2008

Computing the multiplicity structure from geometric involutive form.

[BibT_eX]

[DOI]

Xiaoli Wu

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.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

A fast algorithm for solving the Sylvester structured total least squares problem.

[BibT_eX]

[DOI]

Bingyu Li

Zhuojun Liu

Signal Process., 2007

Foreword.

[BibT_eX]

[DOI]

Dongming Wang

Math. Comput. Sci., 2007

Structured Low Rank Approximation of a Bezout Matrix.

[BibT_eX]

[DOI]

Dongxia Sun

Math. Comput. Sci., 2007

Numerical optimization in hybrid symbolic-numeric computation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation, 2007

Approximate GCDs of polynomials and SOS relaxation.

[BibT_eX]

[DOI]

Bin Li

Jiawang Nie

Proceedings of the Symbolic-Numeric Computation, 2007

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation, 2007

Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).

[BibT_eX]

[DOI]

Bin Li

Kartik Sivaramakrishnan

Proceedings of the Symbolic-Numeric Computation, 2007

2006

Hybrid symbolic-numeric computation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2004

QR factoring to compute the GCD of univariate approximate polynomials.

[BibT_eX]

[DOI]

Robert M. Corless

Stephen M. Watt

IEEE Trans. Signal Process., 2004

Approximate factorization of multivariate polynomials via differential equations.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

Hybrid Method for Solving New Pose Estimation Equation System.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra and Geometric Algebra with Applications, 2004

2003

A complete symbolic-numeric linear method for camera pose determination.

[BibT_eX]

[DOI]

Gregory J. Reid

Jianliang Tang

Proceedings of the Symbolic and Algebraic Computation, 2003

2000

Pseudofactors of multivariate polynomials.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1998

Nearest Singular Polynomials.

[BibT_eX]

[DOI]

Wenda Wu

J. Symb. Comput., 1998

1997

Optimal algorithm for algebraic factoring.

[BibT_eX]

[DOI]