Bican Xia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bican Xia has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
- Naijun Zhan
Peking University
11 shared publications - Liyun Dai
LMAM & School of Mathematical Sciences Peking University
6 shared publications - Tianqi Zhao
Zhongguancun Laboratory
6 shared publications - Haokun Li
Peking University, School of Mathematical Sciences, Beijing, China
5 shared publications - Ting Gan
School of Computer Science, Wuhan University, Wuhan, China
5 shared publications - Hao Wu
University of Chinese Academy of Sciences
4 shared publications
Latest Publications
- 5 October 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (3) , 73
A Dual Riemannian Augmented Lagrangian Method for Low-Rank SDPs with Unit Diagonal
- 5 October 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 109 (3) , 73
A Dual Riemannian Augmented Lagrangian Method for Low-Rank SDPs with Unit Diagonal
- Open Access
- 12 August 2026
- Published by Elsevier in SSRN Electronic Journal
Detecting Nonproperness of Likelihood Equations
Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function. The positive critical points are the positive solutions to an algebraic system, say likelihood equations. So, identifying the number of positive critical points is a real root classification problem for the likelihood equations. A discriminant variety of a likelihood-equation system geometrically describes the data for which the number of real solutions becomes unusual. As an essential component of the discriminant variety, the nonproperness set collects the data such that the likelihood-equation system has a solution at infinity. So, the number of real solutions varies when the data passes the nonproperness set, and identifying the nonproperness set plays a crucial role in the real root classification. In this work, we develop a novel method for computing nonproperness sets of likelihood-equation systems. We prove the correctness of this method. We show experimentally that it is far more efficient than the known methods in the literature.
- 12 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessDetecting Nonproperness of Likelihood Equations
Given an algebraic statistical model, a challenging problem is classifying the data according to the number of positive critical points of the likelihood function. The positive critical points are the positive solutions to an algebraic system, say likelihood equations. So, identifying the number of positive critical points is a real root classification problem for the likelihood equations. A discriminant variety of a likelihood-equation system geometrically describes the data for which the number of real solutions becomes unusual. As an essential component of the discriminant variety, the nonproperness set collects the data such that the likelihood-equation system has a solution at infinity. So, the number of real solutions varies when the data passes the nonproperness set, and identifying the nonproperness set plays a crucial role in the real root classification. In this work, we develop a novel method for computing nonproperness sets of likelihood-equation systems. We prove the correctness of this method. We show experimentally that it is far more efficient than the known methods in the literature.
- Open Access
- 16 April 2026
- Published by Springer Nature
- p. 353-373
Quantifier Elimination Meets Treewidth
- 16 April 2026
- Published by Springer Nature
- p. 353-373
Open AccessQuantifier Elimination Meets Treewidth
- Open Access
A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
This paper proposes a dual Riemannian alternating direction method of multipliers (ADMM) for solving low-rank semidefinite programs with unit diagonal constraints. We recast the ADMM subproblem as a Riemannian optimization problem over the oblique manifold by performing the Burer-Monteiro factorization. Global convergence of the algorithm is established assuming that the subproblem is solved to certain optimality. Numerical experiments demonstrate the excellent performance of the algorithm. It outperforms, by a significant margin, a few advanced SDP solvers (MOSEK, COPT, SDPNAL+, ManiSDP) in terms of accuracy, efficiency, and scalability on second-order SDP relaxations of dense and sparse binary quadratic programs.
Open AccessA Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
This paper proposes a dual Riemannian alternating direction method of multipliers (ADMM) for solving low-rank semidefinite programs with unit diagonal constraints. We recast the ADMM subproblem as a Riemannian optimization problem over the oblique manifold by performing the Burer-Monteiro factorization. Global convergence of the algorithm is established assuming that the subproblem is solved to certain optimality. Numerical experiments demonstrate the excellent performance of the algorithm. It outperforms, by a significant margin, a few advanced SDP solvers (MOSEK, COPT, SDPNAL+, ManiSDP) in terms of accuracy, efficiency, and scalability on second-order SDP relaxations of dense and sparse binary quadratic programs.
- 11 November 2025
- Published by Springer Nature
- p. 329-347
Avoiding Larger Conflict Regions in CDCL-Style Methods for Solving SMT-NRA
- 11 November 2025
- Published by Springer Nature
- p. 329-347
Avoiding Larger Conflict Regions in CDCL-Style Methods for Solving SMT-NRA
- 12 February 2025
- Published by Springer Nature
- p. 256-274
Local Search for Checking Satisfiability of Formulas with Trigonometric Functions
- 12 February 2025
- Published by Springer Nature
- p. 256-274
Local Search for Checking Satisfiability of Formulas with Trigonometric Functions
- Open Access
- 13 September 2024
- Published by Springer Nature
- p. 248-266
On Completeness of SDP-Based Barrier Certificate Synthesis over Unbounded Domains
Barrier certificates, serving as differential invariants that witness system safety, play a crucial role in the verification of cyber-physical systems (CPS). Prevailing computational methods for synthesizing barrier certificates are based on semidefinite programming (SDP) by exploiting Putinar Positivstellensatz. Consequently, these approaches are limited by the Archimedean condition, which requires all variables to be bounded, i.e., systems are defined over bounded domains. For systems over unbounded domains, unfortunately, existing methods become incomplete and may fail to identify potential barrier certificates.In this paper, we address this limitation for the unbounded cases. We first give a complete characterization of polynomial barrier certificates by using homogenization, a recent technique in the optimization community to reduce an unbounded optimization problem to a bounded one. Furthermore, motivated by this formulation, we introduce the definition of homogenized systems and propose a complete characterization of a family of non-polynomial barrier certificates with more expressive power. Experimental results demonstrate that our two approaches are more effective while maintaining a comparable level of efficiency.
- 13 September 2024
- Published by Springer Nature
- p. 248-266
Open AccessOn Completeness of SDP-Based Barrier Certificate Synthesis over Unbounded Domains
Barrier certificates, serving as differential invariants that witness system safety, play a crucial role in the verification of cyber-physical systems (CPS). Prevailing computational methods for synthesizing barrier certificates are based on semidefinite programming (SDP) by exploiting Putinar Positivstellensatz. Consequently, these approaches are limited by the Archimedean condition, which requires all variables to be bounded, i.e., systems are defined over bounded domains. For systems over unbounded domains, unfortunately, existing methods become incomplete and may fail to identify potential barrier certificates.In this paper, we address this limitation for the unbounded cases. We first give a complete characterization of polynomial barrier certificates by using homogenization, a recent technique in the optimization community to reduce an unbounded optimization problem to a bounded one. Furthermore, motivated by this formulation, we introduce the definition of homogenized systems and propose a complete characterization of a family of non-polynomial barrier certificates with more expressive power. Experimental results demonstrate that our two approaches are more effective while maintaining a comparable level of efficiency.
- Open Access
- 11 September 2024
- Published by Springer Nature
- p. 92-110
Nonlinear Craig Interpolant Generation Over Unbounded Domains by Separating Semialgebraic Sets
Interpolation-based techniques become popular in recent years, as they can improve the scalability of existing verification techniques due to their inherent modularity and local reasoning capabilities. Synthesizing Craig interpolants is the cornerstone of these techniques. In this paper, we investigate nonlinear Craig interpolant synthesis for two polynomial formulas of the general form, essentially corresponding to the underlying mathematical problem to separate two disjoint semialgebraic sets. By combining the homogenization approach with existing techniques, we prove the existence of a novel class of non-polynomial interpolants called semialgebraic interpolants. These semialgebraic interpolants subsume polynomial interpolants as a special case. To the best of our knowledge, this is the first existence result of this kind. Furthermore, we provide complete sum-of-squares characterizations for both polynomial and semialgebraic interpolants, which can be efficiently solved as semidefinite programs. Examples are provided to demonstrate the effectiveness and efficiency of our approach.
- 11 September 2024
- Published by Springer Nature
- p. 92-110
Open AccessNonlinear Craig Interpolant Generation Over Unbounded Domains by Separating Semialgebraic Sets
Interpolation-based techniques become popular in recent years, as they can improve the scalability of existing verification techniques due to their inherent modularity and local reasoning capabilities. Synthesizing Craig interpolants is the cornerstone of these techniques. In this paper, we investigate nonlinear Craig interpolant synthesis for two polynomial formulas of the general form, essentially corresponding to the underlying mathematical problem to separate two disjoint semialgebraic sets. By combining the homogenization approach with existing techniques, we prove the existence of a novel class of non-polynomial interpolants called semialgebraic interpolants. These semialgebraic interpolants subsume polynomial interpolants as a special case. To the best of our knowledge, this is the first existence result of this kind. Furthermore, we provide complete sum-of-squares characterizations for both polynomial and semialgebraic interpolants, which can be efficiently solved as semidefinite programs. Examples are provided to demonstrate the effectiveness and efficiency of our approach.
- Open Access
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 56-64
Reduction of Transcendental Decision Problems over the Reals
A special class of univariate transcendental decision problems called “trigonometric extension” is studied in this paper. Roughly speaking, a trigonometric extension is a ring of univariate analytic functions obtained by adjoining trigonometric functions to a ring consisting of functions having only finitely many real zeros. It is shown that in this case, the decision problem can be reduced to looking for solutions in a bounded domain. Based on the reduction, several new decidability results are established when Schanuel’s Conjecture is assumed. Furthermore, for the theory of multivariate trigonometric extension, it is proved that, although a small fragment of the theory can be reduced to the univariate case, the general theory is undecidable.
- 16 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 56-64
Open AccessReduction of Transcendental Decision Problems over the Reals
A special class of univariate transcendental decision problems called “trigonometric extension” is studied in this paper. Roughly speaking, a trigonometric extension is a ring of univariate analytic functions obtained by adjoining trigonometric functions to a ring consisting of functions having only finitely many real zeros. It is shown that in this case, the decision problem can be reduced to looking for solutions in a bounded domain. Based on the reduction, several new decidability results are established when Schanuel’s Conjecture is assumed. Furthermore, for the theory of multivariate trigonometric extension, it is proved that, although a small fragment of the theory can be reduced to the univariate case, the general theory is undecidable.
- 15 December 2023
- Published by Springer Nature
- p. 171-188
Solving SMT over Non-linear Real Arithmetic via Numerical Sampling and Symbolic Verification
- 15 December 2023
- Published by Springer Nature
- p. 171-188
Solving SMT over Non-linear Real Arithmetic via Numerical Sampling and Symbolic Verification