Extended Vertical LCP (EVLCP): Theory & Methods

• EVLCP is a piecewise-linear system defined by the componentwise minimum of multiple linear functions, generalizing standard LCP models.
• It leverages the row 𝒲-property to ensure unique solvability and to derive robust global error bounds and perturbation results.
• Recent research reformulates EVLCP as NGAVE, leading to fixed-time dynamical solvers that reduce computational workload significantly.

The extended vertical linear complementarity problem (EVLCP) is the problem of finding $x\in\mathbb R^n$ such that

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$

with the minimum taken componentwise, for given matrices $A_0,\dots,A_k\in\mathbb R^{n\times n}$ and vectors $q_0,\dots,q_k\in\mathbb R^n$. In alternative notation, the block tuple may be written as $\mathbf M=(M_0,\dots,M_k)$ and $\mathbf q=(q_0,\dots,q_k)$. EVLCP contains the standard linear complementarity problem and the vertical LCP as special cases, and has been studied through solvability theory, global error bounds, perturbation analysis, and continuous-time dynamical solvers (Wu et al., 2022, Wu et al., 2022, Wei et al., 28 Jul 2025).

1. Formulation and scope

For positive integers $n$ and $k$, EVLCP$(\mathbf M,\mathbf q)$ asks for $x\in\mathbb R^n$ satisfying

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$0

The componentwise minimum makes the problem piecewise linear, but not globally linear. The standard LCP is recovered when $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$1, $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$2, $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$3, and $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$4. The vertical LCP is recovered when $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$5 and $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$6; in the literature summarized here, the vertical LCP is associated with Cottle–Dantzig.

The formulation unifies several model classes. Reported applications include network theory, control, game theory, and Hamilton–Jacobi–Bellman equations, as well as piecewise-linear electrical networks, singular control problems, real option valuation, generalized Leontief input-output models, and generalized bimatrix games. The breadth of this application list reflects the fact that the componentwise minimum naturally represents switching, selection, and regime-dependent linear structure rather than a single linear law.

A common misconception is that EVLCP is only a notational extension of the LCP. The literature treats it instead as a genuine umbrella model: the number of blocks is arbitrary, the minimum is taken across all blocks, and the algebraic conditions governing uniqueness and stability are correspondingly more intricate than in the single-matrix LCP setting.

2. Row $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$7-property and unique solvability

The central structural condition is the row $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$8-property. A block matrix $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$9 has the row $A_0,\dots,A_k\in\mathbb R^{n\times n}$0-property if, for every $A_0,\dots,A_k\in\mathbb R^{n\times n}$1,

$A_0,\dots,A_k\in\mathbb R^{n\times n}$2

where the inequalities are componentwise. This condition is known to be equivalent to unique solvability of EVLCP for every right-hand side: EVLCP$A_0,\dots,A_k\in\mathbb R^{n\times n}$3 has a unique solution $A_0,\dots,A_k\in\mathbb R^{n\times n}$4 for every $A_0,\dots,A_k\in\mathbb R^{n\times n}$5 if and only if $A_0,\dots,A_k\in\mathbb R^{n\times n}$6 has the row $A_0,\dots,A_k\in\mathbb R^{n\times n}$7-property (Wu et al., 2022).

A determinant-type characterization, attributed to Gowda–Sznajder in the summarized material, states that the row $A_0,\dots,A_k\in\mathbb R^{n\times n}$8-property holds if and only if for every choice of nonnegative diagonal matrices $A_0,\dots,A_k\in\mathbb R^{n\times n}$9 with $q_0,\dots,q_k\in\mathbb R^n$0 positive on the diagonal,

$q_0,\dots,q_k\in\mathbb R^n$1

A directly operational equivalent form uses diagonal selectors: $q_0,\dots,q_k\in\mathbb R^n$2 and $q_0,\dots,q_k\in\mathbb R^n$3 has the row $q_0,\dots,q_k\in\mathbb R^n$4-property if and only if $q_0,\dots,q_k\in\mathbb R^n$5 is nonsingular for every $q_0,\dots,q_k\in\mathbb R^n$6 (Wu et al., 2022).

Two additional necessary and sufficient conditions were highlighted in the 2022 error-bound study. First, the row $q_0,\dots,q_k\in\mathbb R^n$7-property is equivalent to nonsingularity of

$q_0,\dots,q_k\in\mathbb R^n$8

for every diagonal choice $q_0,\dots,q_k\in\mathbb R^n$9 with $\mathbf M=(M_0,\dots,M_k)$0 and $\mathbf M=(M_0,\dots,M_k)$1. Second, $\mathbf M=(M_0,\dots,M_k)$2 has the row $\mathbf M=(M_0,\dots,M_k)$3-property if and only if, for every diagonal $\mathbf M=(M_0,\dots,M_k)$4, the two-block system

$\mathbf M=(M_0,\dots,M_k)$5

is also row $\mathbf M=(M_0,\dots,M_k)$6, with $\mathbf M=(M_0,\dots,M_k)$7 (Wu et al., 2022). These formulations matter because they replace combinatorial reasoning over row patterns by diagonal convex-combination tests.

3. Global error bounds

A major development in the recent EVLCP literature is a new derivation of global error bounds from a scalar identity for minima. For real numbers $\mathbf M=(M_0,\dots,M_k)$8, there exist $\mathbf M=(M_0,\dots,M_k)$9 with $\mathbf q=(q_0,\dots,q_k)$0 such that

$\mathbf q=(q_0,\dots,q_k)$1

Applied rowwise to EVLCP, with $\mathbf q=(q_0,\dots,q_k)$2 denoting the unique solution and

$\mathbf q=(q_0,\dots,q_k)$3

this yields diagonal matrices $\mathbf q=(q_0,\dots,q_k)$4 satisfying $\mathbf q=(q_0,\dots,q_k)$5 and

$\mathbf q=(q_0,\dots,q_k)$6

Under the row $\mathbf q=(q_0,\dots,q_k)$7-property, the matrix

$\mathbf q=(q_0,\dots,q_k)$8

is nonsingular, and therefore

$\mathbf q=(q_0,\dots,q_k)$9

The norm may be any vector-matrix norm. This bound is global and two-sided in the sense used in the source exposition, and its derivation avoids row permutations entirely (Wu et al., 2022).

The comparison with earlier bounds is explicit. In the standard LCP setting, Mathias–Pang obtained

$n$0

Chen–Xiang showed, in any $n$1-norm,

$n$2

which is equivalent to the EVLCP bound above when $n$3 and $n$4. Zhang–Chen–Xiu proved, under the row $n$5-property,

$n$6

with

$n$7

requiring exploration of row rearrangements and pair selections. The reported computational cost grows like $n$8, whereas the newer bound needs only a single worst-case inverse norm over diagonal convex combinations and thus eliminates the factorial blow-up (Wu et al., 2022).

An illustrative example with $n$9 and $k$0 used

$k$1

The row-rearrangement approach requires inspection of $k$2 rearrangements and over a hundred inverse-norm evaluations, while the new theorem reduces the task to

$k$3

obtained through a small convex-programming problem over the simplex of selector variables. This example shows that the simplification is not merely formal; it directly reduces workload in bound estimation.

4. Perturbation bounds and sensitivity analysis

Perturbation theory for EVLCP analyzes how the solution changes when both the block matrices and the vectors are perturbed. With

$k$4

assume that both $k$5 and $k$6 have the row $k$7-property, and let $k$8 and $k$9 be the corresponding unique solutions. A convex-combination identity analogous to the error-bound argument produces diagonal matrices $(\mathbf M,\mathbf q)$0 such that

$(\mathbf M,\mathbf q)$1

This leads to the amplification factors

$(\mathbf M,\mathbf q)$2

and the absolute perturbation bound

$(\mathbf M,\mathbf q)$3

If only the vectors are perturbed, then

$(\mathbf M,\mathbf q)$4

These formulas generalize sensitivity bounds known for the LCP and VLCP (Wu et al., 2022).

For simultaneous matrix and vector perturbations, the theory introduces

$(\mathbf M,\mathbf q)$5

and proves that every $(\mathbf M,\mathbf q)$6 has the row $(\mathbf M,\mathbf q)$7-property together with

$(\mathbf M,\mathbf q)$8

Consequently, if $(\mathbf M,\mathbf q)$9 and $x\in\mathbb R^n$0 solve the associated EVLCPs, then

$x\in\mathbb R^n$1

The same work also gives a relative perturbation estimate. If

$x\in\mathbb R^n$2

and

$x\in\mathbb R^n$3

then $x\in\mathbb R^n$4 has the row $x\in\mathbb R^n$5-property and

$x\in\mathbb R^n$6

Computable bounds for $x\in\mathbb R^n$7 are available under additional matrix structure. If each $x\in\mathbb R^n$8 has positive diagonal and satisfies the comparison-matrix condition

$x\in\mathbb R^n$9

then

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$00

If each $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$01 is strictly diagonally row-dominant, then

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$02

These estimates convert the abstract perturbation constants into directly evaluable quantities (Wu et al., 2022).

The numerical examples in the perturbation study emphasize conservativeness rather than instability. In a two-by-two EVLCP example with $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$03, the reported relative error was approximately $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$04, while two bounds were approximately $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$05 and $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$06. In a three-by-three VLCP example with $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$07, the relative error was approximately $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$08 and the bound approximately $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$09. For a Hamilton–Jacobi–Bellman discretization with $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$10, the bounds tracked the actual relative error within a modest factor (Wu et al., 2022).

5. Reformulation as generalized absolute-value equations

A 2025 development recasts EVLCP as a special case of a new kind of generalized absolute value equations (NGAVE). The construction is recursive. One defines

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$11

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$12

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$13

and, in general,

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$14

The NGAVE of order $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$15 is

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$16

The paper shows that EVLCP can be embedded into this nested absolute-value framework (Wei et al., 28 Jul 2025).

For the case $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$17,

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$18

with

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$19

and

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$20

where $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$21 is any positive diagonal matrix. Similar nested-absolute-value representations are stated for $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$22, and higher orders.

Under the spectral condition

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$23

the NGAVE $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$24 admits a unique solution for every choice of the vectors $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$25. The proof proceeds by constructing

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$26

and showing that $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$27 is a contraction, so Banach’s fixed-point theorem applies. Under the same assumption, the paper gives the error-bound inequality

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$28

This route supplies a distinct sufficient condition for unique solvability and an accompanying residual-based bound, but now expressed in the NGAVE variables rather than directly in the row $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$29-framework (Wei et al., 28 Jul 2025).

6. Fixed-time dynamical solution methods and computational interpretation

The NGAVE reformulation supports a fixed-time stable continuous-time solver. The model is

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$30

where $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$31 is chosen so that the system is continuous and yields fixed-time convergence, with parameters $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$32, $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$33, $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$34, and $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$35. With the Lyapunov function

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$36

the dynamics satisfy

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$37

Using a fixed-time stability lemma of Polyakov (2011), every trajectory reaches $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$38 in at most

$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$39

independently of the initial condition (Wei et al., 28 Jul 2025).

The reported numerical study considered three test sets with $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$40 and problem sizes up to $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$41 for $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$42. The EVLCP instances were constructed so that the exact solution $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$43 was known and the condition $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$44 was verifiable. The baseline was the smoothing-neural-network model of Hou–Zhang–Qiu (2022), and the metrics were the residual $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$45, CPU time, and the relative error $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$46. The fixed-time dynamical system was reported to converge in CPU time orders of magnitude smaller than the neural network, to reach the $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$47 residual tolerance uniformly, and to yield relative errors on the order of $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$48–$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$49, compared with $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$50–$\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$51 for the baseline. Trajectory plots of $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$52 were reported to confirm convergence well before the theoretical $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$53, indicating that the analytic bound is conservative but valid (Wei et al., 28 Jul 2025).

Taken together, the recent literature presents two complementary computational viewpoints. One viewpoint, based on the row $\min\{A_0x+q_0,\;A_1x+q_1,\;\dots,\;A_kx+q_k\}=0,$54-property and diagonal selectors, focuses on sharp residual-to-solution error bounds and perturbation constants without combinatorial row rearrangement. The other viewpoint, based on NGAVE reformulation, produces inverse-free fixed-time dynamics and a separate spectral sufficient condition for uniqueness. This suggests that EVLCP is best understood not as a single algorithmic object, but as a family of piecewise-linear systems admitting multiple analytic lenses: complementarity-theoretic, perturbational, and dynamical.