共查询到20条相似文献,搜索用时 125 毫秒
1.
给定 n阶方阵及其若当矩阵 ,讨论所有与该若当矩阵可交换的矩阵空间的结构 ,得出方阵的所有相似变换矩阵的空间结构 . 相似文献
2.
袁永新 《高等学校计算数学学报》2003,25(3):221-226
1 引 言 本文用R~(m×n)表示全体m×n阶实矩阵的集合,R~n为所有n维列向量的全体,OR~(n×n)为n阶正交矩阵的集合,I_n为n阶单位矩阵,A~T,A~ ,B(A),R(A)~⊥,N(A)分别表示矩阵A的转置,Moore-Penrose广义逆,值域,值域的正交补空间及零空间,Ps是 相似文献
3.
4.
设A是m×n阶复矩阵,分解式A=QH称为A的广义极分解,如果Q是m×n阶次酉短阵和H是n×n半正定的Hermite矩阵.本文给出了广义极分解的一些性质和推广了有关近似极因子的相关结论. 相似文献
5.
6.
1 引言 设Rn×m为所有n×m实矩阵的集合,ASRn×n为n阶实反对称矩阵的集合,ORn×n 为n阶实正交矩阵的全体. In是n阶单位矩阵,A+,R(A),N(A)分别表示矩阵A的 Moore-Penrose广义逆、值域及零空间,并记EA=I-AA+,FA=I-A+A(I为单位矩 阵,A为任意矩阵).对A=(aij),B=(bij)∈Rn×m,A*B=(aijbij)表示矩阵A与B 的Hadamard积.在Rn×m上定义矩阵A与B的内积为(A,B)=tr(BT A),则由此内积 导出的范数‖A‖=(A,A)~(1/2)是矩阵的Frobenius范数,并且Rn×m构成一个完备的内积 空间. 相似文献
7.
考虑这样一类Sylvester矩阵方程:AX XB=C,A,B分别为n阶正半定、正定矩阵,C为n阶矩阵.给出了一个收敛的迭代算法. 相似文献
8.
在讨论参数估计的容许性问题时,我们常常要考虑矩阵的偏序关系.即设A,B均为n阶对称矩阵.著A-B是非负定阵,则称A大于等于B,记作A≥B,记号A≥0表示A为半正定阵.由矩阵不等式可导出根多数值不等式,如文[1]中有如下众所周知的结论: 相似文献
9.
1引言令R~(n×m)、OR~(n×n)、SR~(n×n)(SR_0~(n×n))分别表示所有n×m阶实矩阵、n阶实正交阵、n阶实对称矩阵(实对称半正定阵)的全体,A~ 表示A的Moore-Penrose广义逆,I_k表示k阶单位矩阵,S_k表示k阶反序单位矩阵。R(A)表示A的列空间,N(A)表示A的零空间,rank(A)表示矩阵A的秩。对A=(a_(ij)),B=(b_(ij))∈R~(n×m),A*B表示A与 相似文献
10.
线性矩阵方程的埃尔米特广义反汉密尔顿半正定解 总被引:1,自引:0,他引:1
利用埃尔米特广义反汉密尔顿半正定矩阵的表示定理,作者建立了线性矩阵方程在埃尔米特广义反汉密尔顿半正定矩阵集合中可解的充分必要条件,得到了解的一般表达式.对于逆特征值问题,也得到了可解的充分必要条件.对于任意一个 n 阶复矩阵,得到了相关最佳逼近问题解的表达式. 相似文献
11.
12.
13.
多目标半定规划的互补弱鞍点和G-鞍点最优性条件 总被引:1,自引:0,他引:1
对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题,给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义.然后,在较弱的凸性条件下,利用含矩阵和向量约束的择一性定理,建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件. 相似文献
14.
In this paper we consider the standard linear SDP problem, and its low rank nonlinear programming reformulation, based on
a Gramian representation of a positive semidefinite matrix. For this nonconvex quadratic problem with quadratic equality constraints,
we give necessary and sufficient conditions of global optimality expressed in terms of the Lagrangian function. 相似文献
15.
《Optimization》2012,61(6):1075-1105
ABSTRACTIn this paper, we consider a class of sparse inverse semidefinite quadratic programming problems, in which a nonconvex alternating direction method of multiplier is investigated. Under mild conditions, we establish convergence results of our algorithm and the corresponding non-ergodic iteration-complexity is also considered under the assumption that the potential function satisfies the famous Kurdyka–?ojasiewicz property. Numerical results show that our algorithm is suitable to solve the given sparse inverse semidefinite quadratic programming problems. 相似文献
16.
We show that SDP (semidefinite programming) and SOCP (second order cone programming) relaxations provide exact optimal solutions for a class of nonconvex quadratic optimization problems. It is a generalization of the results by S. Zhang for a subclass of quadratic maximization problems that have nonnegative off-diagonal coefficient matrices of quadratic objective functions and diagonal coefficient matrices of quadratic constraint functions. A new SOCP relaxation is proposed for the class of nonconvex quadratic optimization problems by extracting valid quadratic inequalities for positive semidefinite cones. Its effectiveness to obtain optimal values is shown to be the same as the SDP relaxation theoretically. Numerical results are presented to demonstrate that the SOCP relaxation is much more efficient than the SDP relaxation. 相似文献
17.
In this paper, with the help of convex-like function, we discuss the duality theory for nonconvex semidefinite programming.
Our contributions are: duality theory for the general nonconvex semidefinite programming when Slater’s condition holds; perfect
duality for a special case of the nonconvex semidefinite programming for which Slater’s condition fails. We point out that
the results of Fan (Appl. Math. Lett. 18:1068–1073, 2005) can be regarded as a special case of our result. 相似文献
18.
19.