Related papers: On Column sufficiency and Extended Horizontal Line…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
In this paper, we introduce the $k\times n$ (with $k\leq n$) truncated, supplemented Pascal matrix which has the property that any $k$ columns form a linearly independent set. This property is also present in Reed-Solomon codes; however,…
A bounded subset of a normed linear space is said to be (diametrically) complete if it cannot be enlarged without increasing the diameter. A complete super set of a bounded set $K$ having the same diameter as $K$ is called a completion of…
This paper considers the linear objective function optimization with respect to a novel system of fuzzy relation equations, where the fuzzy compositions are defined by the minimum t-norm. It is proved that the feasible solution set is…
In this note we introduce the concept of a quasi-finite complex. Next, we show that for a given countable and locally finite CW complex L the following conditions are equivalent: (i) L is quasi-finite. (ii) There exists a [L]-invertible…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…
Although a unique solution is guaranteed in the Linear complementarity problem (LCP) when the matrix $\mathbf{M}$ is positive definite, practical applications often involve cases where $\mathbf{M}$ is only positive semi-definite, leading to…
The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications.…
The problem of matrix completion and decomposition in the cone of positive semidefinite (PSD) matrices is a well-understood problem, with many important applications in areas such as linear algebra, optimization, and control theory. This…
We establish extension theorems for separately holomorphic mappings defined on sets of the form W\setminus M with values in a complex analytic space which possesses the Hartogs extension property. Here W is a 2-fold cross of arbitrary…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
For a fixed projective scheme X, a property P of line bundles is satisfied by sufficiently ample line bundles if there exists a line bundle L_0 on X such that P(L) holds for any L with (L - L_0) ample. As an example, sufficiently ample line…
We introduce the homogeneous and piecewise multilinear extensions and the eigenvalue problem for locally Lipschitz function pairs, in order to develop a systematic framework for relating discrete and continuous min-max problems. This also…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
A seminal result of Gerstenhaber gives the maximal dimension of a linear space of nilpotent matrices. It also exhibits the structure of this space where the maximal dimension is attained. Extensions of this result in the direction of linear…
We call a matrix completely mixable if the entries in its columns can be permuted so that all row sums are equal. If it is not completely mixable, we want to determine the smallest maximal and largest minimal row sum attainable. These…