相关论文: On the $\top$-Stein equation $X=AX^\top B+C$

In this paper, we derive some necessary and sufficient solvability conditions for some systems of one sided coupled Sylvester-type real quaternion matrix equations in terms of ranks and generalized inverses of matrices. We also give the…

We show that the higher-order matching problem is decidable using a game-theoretic argument.

We consider inhomogeneous matrix products over max-plus algebra, where the matrices in the product satisfy certain assumptions under which the matrix products of sufficient length be rank-one, as it was shown in [6][L. Shue, B.D.O.…

In this paper, we prove a conjecture which was presented in a recent paper [Linear Algebra Appl. 2016; 496: 549--593]. We derive some practical necessary and sufficient conditions for the existence of a solution to a system of coupled…

A transforation between a hierarchy of integrable equations arising from the standard $R$-matrix construction on the algebra of differential operators and a hierarchy of integrable equations arising from a deformation of the standard…

In this paper, by using $|x|=2\max\{0,x\}-x$, a class of maximum-based iteration methods is established to solve the generalized absolute value equation $Ax-B|x|=b$. Some convergence conditions of the proposed method are presented. By some…

Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…

Consider the nonlinear matrix equation X-sum_{i=1}^{m}A_{i}^{*}X^{p_{i}}A_{i}=Q with p_{i}>0. Sufficient and necessary conditions for the existence of positive definite solutions to the equation with p_{i}>0 are derived. Two perturbation…

In [Q. Xu et al., The solutions to some operator equations, Linear Algebra Appl.(2008), doi:10.1016/j.laa.2008.05.034], Xu et al. provided the necessary and sufficient conditions for the existence of a solution to the equation…

$\newcommand{\Max}{\mathrm{Max4PC}}$ The Four point condition (4PC henceforth) is a well known condition characterising distances in trees $T$. Let $w,x,y,z$ be four vertices in $T$ and let $d_{x,y}$ denote the distance between vertices…

In terms of the concepts of state and state transition, a new algorithm-State Transition Algorithm (STA) is proposed in order to probe into classical and intelligent optimization algorithms. On the basis of state and state transition, it…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum has been shown experimentally to give asymptotically…

In this paper, we mainly study solution uniqueness of some convex optimization problems. Our characterizations of solution uniqueness are in terms of the radial cone. This approach allows us to know when a unique solution is a strong…

This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

We transform the problem of solving linear system of equations $A\mathbf{x}=\mathbf{b}$ to a problem of finding the right singular vector with singular value zero of an augmented matrix $C$, and present two quantum algorithms for solving…

Matrix--vector algorithms, particularly Krylov subspace methods, are widely viewed as the most effective algorithms for solving large systems of linear equations. This paper establishes lower bounds on the worst-case number of…

The aim of this note is to present a numerical method to solve the Stokes problem in a bounded domain with a Dirac source term, which preserves optimality for any approximation order by the finite-element method. It is based on the…