Related papers: Sign controlled solvers for the absolute value equ…
We consider the tensor equation whose coefficient tensor is a nonsingular M-tensor and whose right side vector is nonnegative. Such a tensor equation may have a large number of nonnegative solutions. It is already known that the tensor…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
In this paper, we discussed the unique solvability of the two absolute value matrix equations. The unique solvability condition $\rho (\vert A^{-1} B \vert)<1$ is provided for the generalized absolute value matrix equation (GAVME) $AX + B…
For a variety of regularized optimization problems in machine learning, algorithms computing the entire solution path have been developed recently. Most of these methods are quadratic programs that are parameterized by a single parameter,…
A matrix is called totally nonnegative (TN) if all its minors are nonnegative, and totally positive (TP) if all its minors are positive. Multiplying a vector by a TN matrix does not increase the number of sign variations in the vector. In a…
A novel approach for solving the general absolute value equation $Ax+B|x| = c$ where $A,B\in \mathbb{R}^{m\times n}$ and $c\in \mathbb{R}^m$ is presented. We reformulate the equation as a feasibility problem which we solve via the method of…
In this paper, we mainly focus on the existence and uniqueness of the vertical tensor complementarity problem. Firstly, combining the generalized-order linear complementarity problem with the tensor complementarity problem, the vertical…
We delve into the inverse scattering transform of the real-valued vector modified Korteweg--de Vries equation, emphasizing the challenges posed by $N$ pairs of higher-order poles in the transmission coefficient and the enhanced spectral…
This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A vector solution is the unique solution to an underdetermined linear…
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $\delta$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence…
In this paper a special piecewise linear system is studied. It is shown that, under a mild assumption, the semi-smooth Newton method applied to this system is well defined and the method generates a sequence that converges linearly to a…
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
In this paper, we consider a generalized strong vector quasi-equilibrium problem and we prove the existence of its solutions by using some suxiliary results. One of the established theorems is proved by using an approximation method.
New exact solutions are obtained for several nonlinear physical equations, namely the Navier-Stokes and Euler systems, an isentropic compressible fluid system and a vector nonlinear Schroedinger equation. The solution methods make use of…
We investigate the class of regular-ordered word equations. In such equations, each variable occurs at most once in each side and the order of the variables occurring in both sides is the preserved (the variables can be, however, separated…
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
We introduce a new -as far as we know- problem, according to which we are asked to match sequences of two digits in matrices having entries among those two digits (but others too) and prove that this problem is NP-complete
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usually requires finding specific elements in a group of…
The success of Deep Learning and its potential use in many safety-critical applications has motivated research on formal verification of Neural Network (NN) models. Despite the reputation of learned NN models to behave as black boxes and…
A shift splitting modified Newton-type (SSMN) iteration method is introduced for solving large sparse generalized absolute value equations (GAVEs). The SSMN method is established by replacing the regularized splitting of the coefficient…