Searcharxiv⌕ Search

arXiv subjects

Liqun Qi

Publications and source records attributed to Liqun Qi.

At least 19 recordsLinked to original sources

On $z_{2M}(21,4)$: the Hole Extensions of the Chen--Chen Configuration Are Reducible, and the Extremal Configurations of $z_2(21,4)$ Are Not Unique

The second order extended Zarankiewicz number $z_{2M}(m,n)$ of Qi and Yu allows a secondary half of a $2$-edge to be shared, while the $1$-edge graph stays $C_4$-free and extremal and $1$-edges and main halves stay exclusive. Whether $z_{2M}(21,4)=55$ is open. Since deleting a $2$-edge removes exactly one displayed square, $z_{2M}(21,4)=55$ if and only if there is no irreducible admissible configuration with exactly $56$ displayed squares, and by the cell count of Qi and Yu and the heredity of irreducibility such a configuration without empty cells is an extremal $55$-square configuration of $z_2(21,4)$ plus one $2$-edge at its hole. For the extremal configuration of Chen and Chen we show, by certificates verified in exact rational arithmetic, that all $56$ such extensions have SOS rank at most $55$: $32$ by product relations and $24$ by contraction certificates of Xu--Yan type. We also show, with computer-assisted certificates and an exhaustive isomorphism search, that the extremal configurations of $z_2(21,4)$ fall into at least six isomorphism classes; Chen and Chen leave the structural classification of extremal augmented graphs open. Finally we prove a six-to-four reduction. For irreducible configurations whose $1$-edge graph is $C_4$-free with $m+\binom n2$ edges it bounds the multiplicity of a shared half by $n(n-1)$ ($12$ at $21\times4$), and it applies directly to an explicit number of the extensions of any extremal configuration of $z_2(21,4)$, eight for that of Chen and Chen, bringing each to at most $54$ squares, in agreement with the certificates. The cell count, the heredity lemma, the rows lemma, the six-to-four identity and a $2\times2$ example are checked in Isabelle/HOL; the remaining arguments are written proofs.

math.CO↗

A Second Order Extended Zarankiewicz Number for Biquadratic SOS Rank

We introduce the \emph{second order extended Zarankiewicz number} $z_{2M}(m,n)$, obtained from the second order Zarankiewicz number $z_2(m,n)$ of Löfberg and Qi by relaxing the simplicity condition $(S)$ for the \emph{secondary halves} of 2-edges, while keeping the limited condition $|E_1|=z(m,n)$. We prove the hierarchy $$ BSR(m,n)\ge z_{2M}(m,n)\ge z_2(m,n)\ge z_{SL}(m,n)\ge z_{RL}(m,n)\ge z_{wL}(m,n)\ge z(m,n), $$ and show that $z_{2M}$ is not capped by the universal cell bound. We prove the counting bound $z_{2M}(m,n)\le mn-1$, and a sharper linear-in-$m$ bound for fixed $n$ obtained from orthogonality of coefficient vectors. We analyse how the recursive criterion $(RW3^{+})$ of Löfberg and Qi must be modified under $(S_M)$, prove soundness of the resulting $(RW3^{+}_M)$ for multiplicity-one sharing, and show that a signed sharing closure $(SC)$ can supplement but not replace it. We prove $$ z_{2M}(21,4)\ge 56>55=z_2(21,4). $$ The witness is an explicit $56$-edge $(S_M)$-admissible configuration, and its irreducibility is certified by a full-rank system of $2255$ linear equations in the $1540$ off-diagonal inner products. This reaches Marin's lower bound $BSR(21,4)\ge 56$.

math.CO↗

Overtake and the recursive-line equality for second-order Zarankiewicz numbers

We study two questions about the second-order Zarankiewicz numbers. The first is the recursive-line equality $z_2(m,n)=z_{RL}(m,n)$, known to hold in every computed case and conjectured in general. The second, here called \emph{overtake}, is the strict inequality $z_{2A}(m,n)>z_2(m,n)$ between the second-order augmented number and the second-order number. Both are governed by the number $H_{\mathrm{limited}}(m,n)$ of unoccupied cells in a limited extremal configuration. We prove that the first increase $z_2\to z_2+1$ already costs three unoccupied cells, forcing a unit of one-edge deficit, and the cell identity then bounds the excess $z_{2A}-z_2$ by $\lfloor(H_{\mathrm{limited}}-1)/2\rfloor$. In particular, when the recursive-line hole count is at most two, no overtake occurs. We conjecture the sharp budget $\lfloor H_{\mathrm{limited}}/3\rfloor$ and that $H_{\mathrm{limited}}\ge5$ is the threshold for an overtake. In the computed range $n\le7$, no overtake occurs at any order, the sole exception being the known case $(4,4)$. The recursive-line equality $z_2=z_{RL}$ is verified at every order in the range where both values are determined; the orders at which it remains unsettled are $(12,4)$ and $(14,4)$ at width four, $(11,5)$ at width five, and $(8,7)$ at width seven.

math.CO↗

The Second-Order Augmented Zarankiewicz Number

The second-order Zarankiewicz number $z_2(m,n)$ and the biquadratic sum-of-squares rank $\mathrm{BSR}(m,n)$ are related by the unconditional hierarchy \[ \mathrm{BSR}(m,n)\ \ge\ z_2(m,n)\ \ge\ z_{SL}(m,n)\ \ge\ z_{RL}(m,n) \ \ge\ z_{wL}(m,n)\ \ge\ z(m,n). \] We introduce the \emph{second-order augmented Zarankiewicz number} $z_{2A}(m,n)$, obtained from $z_2(m,n)$ by deleting the requirement that the configuration be \emph{limited}, so that \[ \mathrm{BSR}(m,n)\ \ge\ z_{2A}(m,n)\ \ge\ z_2(m,n). \] Although the defining class is enlarged, $z_{2A}$ still obeys the universal cell bound of Löfberg and Qi, because that bound uses only the \(C_4\)-freeness of the one-edge graph. We prove \[ \mathrm{BSR}(4,4)\ \ge\ z_{2A}(4,4)\ =\ 11\ >\ 10\ =\ z_2(4,4) \ =\ z_{RL}(4,4), \] the first recorded separation between the second-order number and its augmented variant. This result also gives a better lower bound for $\mathrm{BSR}(4,4)$. The lower bound is witnessed by an explicit non-limited $4\times4$ configuration of displayed length $11$ whose recursive-line closure satisfies $(\mathrm{RW}3^+)$; the matching upper bound excludes $12$ by the universal cell bound together with an exact finite classification of the $161$ twelve-square configurations, and \(z_2(4,4)=z_{RL}(4,4)=10\) is the exact value of Xu and Yan.

math.CO↗

Exact Second-Order Zarankiewicz Numbers for Complete-Graph Incidence Families

For $n\ge6$, $m=\binom n2$, let the complete-graph incidence family on $K_n$ have the vertices of $K_n$ as columns, its edges as rows, and the incidence graph as one-edge graph. The universal cell bound of Löfberg and Qi gives $z_2(m,n)\le Z(n):=\lfloor n(n-1)(n+2)/4\rfloor$. We implement the nested one-factorization construction of that family and determine exactly what it certifies. For $n=2q$ with $q$ an odd prime, $q\ge5$, the construction has no hole and the cross-factor transfer equations apply verbatim, giving $z_2=z_{SL}=z_{RL}=Z(n)$; $n=6$ is settled by a separate cyclic witness. For odd $n=2p+1$ the near-perfect one-factorization yields Hamilton paths closed into odd cycles, and the transfer argument breaks: that scheme certifies only $R(G_p)\le Z(n)$. The orders $n=7,8,9,12,13,16,17,18,20,21$ are settled by explicit configurations of a different shape, each attaining the cell bound and satisfying $(\mathrm{RW}3^+)$, obtained from a larger configuration by deleting vertex stars and repairing the restricted grid. At each of these orders $z_2=z_{SL}=z_{RL}=Z(n)$; all remaining orders are conjectural. The first settled order $n=7$ is the only one whose grid has a hole, grounded by a zero-companion rule. Machine-readable configurations and a certificate checker accompany the paper.

math.CO↗

Is the Signed Zarankiewicz Number the Same as the Recursive-line Zarankiewicz Number?

Löfberg and Qi introduced the second order Zarankiewicz number \(z_2\), the recursive-line Zarankiewicz number \(z_{RL}\), and the signed Zarankiewicz number \(z_{SL}\) for doubly simple biquadratic forms. It was shown that \[ z_2(m,n)\ge z_{SL}(m,n)\ge z_{RL}(m,n) \] for all \(m\) and \(n\). However, there was no evidence that there exist particular \(m\) and \(n\) such that \(z_{SL}(m,n)>z_{RL}(m,n)\). The motivation for introducing \(z_{SL}\) was as follows: during the study of the exceptional case \(m=15\), \(n=6\), Löfberg and Qi showed that \[ z_2(15,6)=z_{SL}(15,6)=60, \] but the exact value of \(z_{RL}(15,6)\) was unknown then. In this paper we show that \[ z_{RL}(15,6)=60. \] This eliminates the motivation for introducing \(z_{SL}\). Whether \(z_{SL}(m,n)=z_{RL}(m,n)\) in general remains an open problem. Recently, Lebedev presented an explicit construction separating the augmented Zarankiewicz number \(z_A\) from the limited augmented Zarankiewicz number \(z_L\) at \(m=n=1893\). We hope that the separation problem for \(z_{SL}\) and \(z_{RL}\) can also be solved. We also present the exact values of \(z_{RL}(m,6)\) for \(6\le m\le 16\).

math.CO↗

Second Order Zarankiewicz Number

We introduce the \emph{second order Zarankiewicz number} $z_2(m,n)$ for irreducible doubly simple biquadratic forms with $|E_1|=z(m,n)$, together with the intermediate recursive-line and signed parameters $z_{RL}(m,n)$ and $z_{SL}(m,n)$. They satisfy the unconditional hierarchy \[ \operatorname{BSR}(m,n) \ge z_2(m,n) \ge z_{SL}(m,n) \ge z_{RL}(m,n) \ge z_{wL}(m,n) \ge z(m,n), \] where $z_{RL}$ is defined by the strengthened recursive rectangle criterion $(RW3^+)$ together with the conditions $(S)$ and $C_4$-freeness of $G_1$, and $z_{SL}$ is defined by the signed criterion $(RW3^\pm)$. We show that $(RW3^+)$ is sound and strictly weaker than the literal weak cross-cell test $(W3)$ on the weak-admissible class, and that $(RW3^\pm)$ is likewise sound. At the smallest four-column cases we obtain \[ z_2(5,4)=z_{SL}(5,4)=z_{RL}(5,4)=13>12=z_{wL}(5,4), \] and \[ z_2(6,4)=z_{SL}(6,4)=z_{RL}(6,4)=16>14=z_{wL}(6,4). \] In three columns this yields \[ z_2(m,3)=z_{RL}(m,3)=2m \qquad \text{for all } m\ge 3, \] with strict separation from $z_{wL}(m,3)$ for every $m\ge10$, and exact gap $\lfloor(m-3)/3\rfloor$ for $m\ge16$. Further finite computations give $z_{RL}(5,5)=17$, $z_{RL}(7,4)=19$, and $z_{RL}(7,7)\ge32>28=z_{wL}(7,7)$. Along $N=2p$ with $p$ an odd prime, we obtain the cubic asymptotic separation \[ z_2\!\left(\binom{N}{2},N\right)-z_{wL}\!\left(\binom{N}{2},N\right)\ge \left(\frac{1}{16}-o(1)\right)N^3. \] For the exceptional incidence case $p=3$ we prove $z_{SL}(15,6)=z_2(15,6)=60$. Concurrent work of Chen and Chen, using the recursive-line definition introduced here, incorporates the finite recursive-line values of this manuscript and establishes further exact four-column values together with an eventual formula for all $m\ge15$. The conjectural equality $z_2=z_{RL}$ is supported by the exact two-column, three-column, four-column, and odd-prime incidence families.

math.CO↗

Optimization Models and Computational Bounds for Limited Augmented Zarankiewicz Numbers in the Incidence-Graph Family of Complete Graphs

Let $G_1$ denote the incidence graph of the complete graph $K_{q+1}$. We study limited augmented Zarankiewicz numbers in this family through structured 0--1 optimization models for admissible 2-edge augmentation. For the original framework, we combine exact ILP formulations for the smallest instances with constructive search followed by exact admissibility verification for larger instances. This yields \[ {z_L(6,4)=14,\qquad z_L(10,5)=26,\qquad z_L(15,6)\ge 43,\qquad z_L(21,7)\ge 64,\qquad z_L(28,8)\ge 88.} \] The first two values are exact, whereas the latter three are rigorous lower bounds obtained from explicitly verified admissible families. We then formulate the global weak problem determined by \((S),(W2),(W2'),(W3)\). On the larger incidence-family cases, the corresponding global exact optimization problem is currently computationally out of reach, and our computations provide the certified lower bounds \[ {z_{WL}(6,4)=14,\quad z_{WL}(10,5)\ge 29,\quad z_{WL}(15,6)\ge 46,\quad z_{WL}(21,7)\ge 65,\quad z_{WL}(28,8)\ge 90.} \] On the fourteen literal-grid benchmarks from $(4,3)$ through $(7,7)$, by contrast, the global weak problem is solved exactly. Across this exact benchmark block, the weak framework is never worse than the strong framework and is strictly better in several cases. These computations improve the corresponding classical Zarankiewicz numbers and therefore strengthen available lower bounds for $\operatorname{BSR}(m,n)$ within this family.

math.CO↗

Exact and Asymptotic Values for Weak Limited Augmented Zarankiewicz Numbers in the $m\times 3$ Case

We determine the exact weak limited augmented Zarankiewicz numbers $z_{wL}(m,3)$ for all $m\ge 3$: \[ z_{wL}(m,3)= \begin{cases} m+3+\left\lceil \dfrac{m}{2}\right\rceil+1, & 9\le m\le 15,\\[2mm] m+3+\left\lfloor \dfrac{2m-4}{3}\right\rfloor, & m\ge 16, \end{cases} \] with $z_{wL}(3,3)=6$, $z_{wL}(4,3)=8$, and $z_{wL}(m,3)=2m$ for $5\le m\le 9$. In particular, \[ \lim_{m\to\infty} \frac{z_{wL}(m,3)}{m} = \frac{5}{3}. \] The proof is fully analytic, relying on a uniform base classification, two constructive lower-bound families (staircase and $5m/3$), and a sharp upper-bound argument based on a peeling lemma and the analysis of two W2-sensitive boundary cases. Numerical MILP computations were used only as proof-mining tools to identify the structural lemmas; the final theorem is unconditional. We also extend the known range of the original limited numbers $z_L(m,3)$ through $m=13$, where the gap to $z_{wL}(m,3)$ is only 2 or 3.

math.OC↗

A Weak Condition for Limited Augmented Zarankiewicz Numbers

This paper introduces the weak augmented Zarankiewicz number $z_{wA}(m,n)$ and the weak limited augmented Zarankiewicz number $z_{wL}(m,n)$, which are combinatorial extensions of the classical Zarankiewicz number obtained by relaxing the original admissibility conditions for augmented bipartite graphs. We show that the resulting weak framework still guarantees irreducibility of the associated doubly simple biquadratic forms, with SOS rank equal to the total number of edges. This yields the inequality chain \[ \mathrm{BSR}(m,n) \geq z_{wA}(m,n) \geq z_{wL}(m,n) \geq z_L(m,n) \geq z(m,n). \] We provide three complementary constructions demonstrating the power of the weak framework. First, a $5\times 3$ construction using degenerate 2-edges yields $z_{wL}(5,3)\ge 10>9=z_L(5,3)$, giving $\mathrm{BSR}(5,3)\ge 10$. Second, a $15\times 6$ construction on the incidence graph of $K_6$ with 14 nondegenerate 2-edges gives $z_{wL}(15,6)\ge 44>43$, improving the previously known bound. Third, a critical $6\times 3$ construction with complementary 2-cycles gives $z_{wL}(6,3)\ge 12>11=z_L(6,3)$, yielding $\mathrm{BSR}(6,3)\ge 12$ and demonstrating that complementary 2-cycles are safe.

math.CO↗

Three-Edges and the SOS Rank of Biquadratic Forms

We extend the augmented bipartite graph framework for biquadratic sum-of-squares (SOS) ranks by introducing $3$-edges -- triples of cells representing squares of three-term bilinear forms. We define suitable generalized cycle-free conditions that are purely combinatorial yet sufficient to guarantee that the SOS rank equals the total number of edges, carefully distinguishing occupation by $1$/$2$-edges from occupation by $3$-edges. The main theorem states that for any generalized cycle-free augmented bipartite graph $G$ satisfying the simplicity condition (S), the associated triply simple biquadratic form $P_G$ satisfies $\operatorname{sos}(P_G) = |E_1| + |E_2| + |E_3|$. The proof extends the orthogonality method with a novel trick: when a $2$-edge and a $3$-edge interact, the $3$-edge condition must be invoked rather than the $2$-edge condition. We give three applications. A $5 \times 3$ construction with two $2$-edges, inadmissible under the original definition, is admissible under our new definition, yielding $z_{3L}(5,3) \ge 10$ and improving $z_L(5,3)=9$. A $10 \times 5$ graph using a column-fully-degenerate $3$-edge gives $z_{3L}(10,5) \ge 27$, separating it from $z_L(10,5)=26$. A $15 \times 6$ graph using a half-row-degenerate $3$-edge improves the lower bound for $\operatorname{BSR}(15,6)$ from $43$ to $44$. These are the first explicit applications of $3$-edges to obtain improved lower bounds for $\operatorname{BSR}(m,n)$, and the $5 \times 3$ example demonstrates the power of the refined conditions.

math.CO↗

A General Lower Bound for the Limited Augmented Zarankiewicz Number based upon Complete Graphs

The limited augmented Zarankiewicz number $z_L(m,n)$ satisfies $\operatorname{BSR}(m,n)\ge z_L(m,n)\ge z(m,n)$, where $\operatorname{BSR}(m,n)$ is the maximum SOS rank of $m\times n$ biquadratic forms and $z(m,n)$ is the classical Zarankiewicz number. Our main result is a general lower bound for $z_L(m,n)$ based on the incidence graph of the complete graph $K_{4t}$. For every integer $t\ge 1$, let $m = \binom{4t}{2}$ and $n = 4t$. Then $$ \operatorname{BSR}(m,n) \;\ge\; z_L(m,n) \;\ge\; 2\binom{4t}{2} + 4t^2 - 2t. $$ Since $z = 2\binom{4t}{2} = Θ(t^2)$, the gap satisfies $z_L - z \ge 4t^2 - 2t = Θ(t^2) = Θ(m)$, i.e., it grows linearly in $m$. Moreover, $$ \frac{z_L - z}{z} \;\ge\; \frac{4t^2}{16t^2 - 4t} \;\longrightarrow\; \frac{1}{4} \quad \text{as } t\to\infty, $$ so the gap is asymptotically at least $25\%$ of $z$ -- a non-negligible constant fraction. For $t=1$ we obtain $z_L(6,4)\ge 14$, and we prove that this bound is tight, i.e., $z_L(6,4)=14$. For $t=2$ and $t=3$ we obtain $z_L(28,8)\ge 68$ and $z_L(66,12)\ge 162$, respectively, improving previously known bounds. We also determine the exact values of $z_L(m,n)$ for $5\times3$ and $5\times4$: $z_L(5,3)=9$ and $z_L(5,4)=12$. These results serve as base cases for a \emph{lifting method} that constructs admissible limited augmented graphs on $(m+1)\times(n+1)$ from optimal ones on $m\times n$. Applying this method, we obtain new lower bounds: $z_L(6,3)\ge 10$ and $z_L(6,5)\ge 17$. For $5\times 5$ we establish a new lower bound $z_L(5,5)\ge 15$, improving the previously known bound. By a direct construction, we have $z_L(6,6)\ge 20$.

math.CO↗

Biquadratic SOS Rank and Augmented Zarankiewicz Number

This paper introduces the concepts of the augmented Zarankiewicz number $z_A(m,n)$ and the limited augmented Zarankiewicz number $z_L(m,n)$, which are natural combinatorial extensions of the classical Zarankiewicz number. These numbers arise from augmented bipartite graphs that may contain both standard edges (1-edges) and pairs of edges representing squares of binomials (2-edges). The main theoretical result establishes the inequality chain $\operatorname{BSR}(m, n) \geq z_A(m, n) \geq z_L(m, n) \geq z(m, n)$, linking the maximum biquadratic sum-of-squares (SOS) rank to these extremal graph parameters. We determine the exact values of $z_L(m, n)$ for the cases $(m,2)$, $(3,3)$, $(4, 3)$ and $(4,4)$, and provide new lower bounds for the cases $(5,3)$, $(5,4)$, and $(5,5)$. These results yield improved lower bounds for the maximum SOS rank of biquadratic forms, demonstrating that $z_L(m,n)$ can exceed the classical Zarankiewicz number, thereby offering a refined combinatorial perspective on the SOS rank problem.

math.OC↗

Narrowing the Gap: SOS Ranks of $4 \times 3$ Biquadratic Forms and a Lower Bound of $8$

We investigate the maximum sum-of-squares (SOS) rank of biquadratic forms in the critical case of $4 \times 3$ variables, where the general bounds are currently $7 \leq \mathrm{BSR}(4,3) \leq 11$. By analyzing two important structured subclasses, we obtain exact determinations and improved upper bounds that significantly narrow this gap. For simple biquadratic forms those containing only distinct terms of the type $x_i^2 y_j^2$ we prove that the maximum achievable SOS rank is exactly 7, a value attained by a form corresponding to a $C_4$-free bipartite graph with the maximum number of edges. This settles the question for simple forms. For $y$-deficient biquadratic forms a class introduced here that permits cross terms among two of the three $y$-variables while the third appears only in pure square terms we prove an upper bound of $9$ by combining Calderön's theorem on $m\times 2$ forms with the known value $\mathrm{BSR}(4,2) = 5$. Our main result is a constructive proof that $\mathrm{BSR}(4,3) \geq 8$. We present an explicit non-simple, non-deficient $4\times 3$ biquadratic form and prove it requires exactly eight squares, thereby improving the general lower bound. This shows that any form achieving a rank higher than $8$ must possess a more complex algebraic structure, and it reduces the search space for determining the true value of $\mathrm{BSR}(4,3)$. Connections to Zarankiewicz numbers, extremal graph theory, and classical results on sums of squares are highlighted throughout.

math.OC↗

Sum of Squares Rank of Biquadratic Forms and The Zarankiewicz Number

Denote the maximum sos rank of $m \times n$ sum of squares (SOS) biquadratic forms by $BSR(m, n)$. In this paper, we show that $BSR(m, n) \ge z(m, n)$ and conjecture that $BSR(m, n) = z(m, n)$, where $z(m, n)$ is the Zarankiewicz number. Our result coincides with the existing results for $m = 2$, $n = 2$, and $m = n = 3$, and is superior to other previously known lower bounds. Our result also connects graph theory and SOS polynomial theory.

math.OC↗

On the SOS Rank of Simple and Diagonal Biquadratic Forms

We study the sum-of-squares (SOS) rank of simple and diagonal biquadratic forms. For simple biquadratic forms in $3 \times 3$ variables, we show that the maximum SOS rank is exactly $6$, attained by a specific six-term form. We further prove that for any $m \ge 3$, there exists an $m \times m$ simple biquadratic form whose SOS rank is exactly $2m$. Moreover, we show that for all $m, n \ge 3$, the maximum SOS rank over $m \times n$ simple biquadratic forms is at least $m+n$, which implies $\mathrm{BSR}(m,n) \ge m+n$. For diagonal biquadratic forms with nonnegative coefficients, we prove an SOS rank upper bound of $7$, improving the general bound of $8$ for $3 \times 3$ forms. These results provide new lower and upper bounds on the worst-case SOS rank of biquadratic forms and highlight the role of structure in reducing the required number of squares.

math.OC↗

Parallelizable Riemannian Alternating Direction Method of Multipliers for Non-convex Pose Graph Optimization

Pose graph optimization (PGO) is fundamental to robot perception and navigation systems, serving as the mathematical backbone for solving simultaneous localization and mapping (SLAM). Existing solvers suffer from polynomial growth in computational complexity with graph size, hindering real-time deployment in large-scale scenarios. In this paper, by duplicating variables and introducing equality constraints, we reformulate the problem and propose a Parallelizable Riemannian Alternating Direction Method of Multipliers (PRADMM) to solve it efficiently. Compared with the state-of-the-art methods that usually exhibit polynomial time complexity growth with graph size, PRADMM enables efficient parallel computation across vertices regardless of graph size. Crucially, all subproblems admit closed-form solutions, ensuring PRADMM maintains exceptionally stable performance. Furthermore, by carefully exploiting the structures of the coefficient matrices in the constraints, we establish the global convergence of PRADMM under mild conditions, enabling larger relaxation step sizes within the interval $(0,2)$. Extensive empirical validation on two synthetic datasets and multiple real-world 3D SLAM benchmarks confirms the superior computational performance of PRADMM.

math.OC↗

Biquadratic Cauchy Tensors and Spherical Biquadratic Polynomial Programming

This paper addresses biquadratic polynomial programming (BPP), an NP-hard optimization problem closely related to biquadratic tensors. We first establish several necessary and sufficient conditions for the positive semi-definiteness and positive definiteness of biquadratic Cauchy tensors. Leveraging the structured properties of these tensors, we then prove that the BPP and its equivalent multilinear formulation share the same set of optimal solutions. This result allows us to establish the global sequence convergence of the proximal alternating minimization (PAM) algorithm via the Kurdyka- Lojasiewicz (KL) property, extending the analysis in [8]. Furthermore, by reformulating the equivalent multilinear problem as an unconstrained optimization model, we enable the analysis of its KL exponent and derive an explicit expression for the convergence rate of PAM. Finally, numerical experiments are conducted on both biquadratic Cauchy tensors and general biquadratic tensor instances to evaluate the efficiency, stability, and practical performance of the proposed algorithm.

math.OC↗