Related papers: On Column sufficiency and Extended Horizontal Line…
We give a statement on extension with estimates of convex functions defined on a linear subspace, inspired by similar extension results concerning metrics on positive line bundles
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
In theories with (sets of) two large extra dimensions and supersymmetry in the bulk, the presence of non-supersymmetric brane defects naturally induces a logarithmic potential for the volume of the transverse dimensions. Since the logarithm…
This paper investigates the generalized convexity properties of the Lambert $W$ function, defined as the solution to $W(z)e^{W(z)}=z$. Focusing on $H_{p,q}$-convexity and concavity with respect to H\"older means, we derive necessary and…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support a tridiagonal matrix representation of the wave operator. Doing so results in exactly solvable problems with a…
In this paper, we consider integral linear constraints and the dissipation inequality with linear supply rates for certain sets of trajectories confined pointwise in time to a convex cone which belongs to a finite-dimensional normed vector…
The weak-strong uniqueness of solutions to a broad class of cross-diffusion systems with volume filling is established. In general, the diffusion matrices are neither symmetric nor positive definite. This issue is overcome by supposing that…
Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…
Matrices can be augmented by adding additional columns such that a partitioning of the matrix in blocks of rows defines mutually orthogonal subspaces. This augmented system can then be solved efficiently by a sum of projections onto these…
This paper proposes a new gradient method to solve the large-scale problems. Theoretical analysis shows that the new method has finite termination property for two dimensions and converges R-linearly for any dimensions. Experimental results…
By using determinantal representations of the W-weighted Drazin inverse previously obtained by the author within the framework of the theory of the column-row determinants, we get explicit formulas for determinantal representations of the…
We consider the two matrix model with an even quartic potential W(y)=y^4/4+alpha y^2/2 and an even polynomial potential V(x). The main result of the paper is the formulation of a vector equilibrium problem for the limiting mean density for…
We present a new class of hermitian one-matrix models originated in the W-infinity algebra: more precisely, the polynomials defining the W-infinity generators in their fermionic bilinear form are shown to expand the orthogonal basis of a…
We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like…
This paper studies the open problem of conformalized entry prediction in a row/column-exchangeable matrix. The matrix setting presents novel and unique challenges, but there exists little work on this interesting topic. We meticulously…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
In problems involving matrix computations, the concept of leverage has found a large number of applications. In particular, leverage scores, which relate the columns of a matrix to the subspaces spanned by its leading singular vectors, are…
Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system.…
This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…
Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…