Abstract Approximating the closest positive semi-definite bisymmetric matrix using Frobenius norm to a data is important in many engineering applications, communication theory and quantum physics. In this paper, we will use interior point method solve problem. The problem be reformulated into various forms, beginning as programming later, form of mixed semidefintie second-order cone optimizatio...

A matrix A = (aij) ∈ Rn×n is said to be symmetric and antipersymmetric matrix if aij = aji = −an−j+1,n−i+1 for all 1 ≤ i, j ≤ n. Peng gave the bisymmetric solutions of the matrix equation A1X1B1+A2X2B2+. . .+AlXlBl = C, where [X1, X2, . . . , Xl] is a real matrices group. Based on this work, an adjusted iterative method is proposed to find the symmetric and antipersymmetric solutions of the abo...

Specially structured linear complementarity problems (LCPs) and their solution by the miss-cross method are examined. The criss-cross method is known to be finite for LCPs with positive semidefinite bisymmetric matrices and with P-matrices. It is also a simple finite algorithm for oriented matroid programming problems. Recently Cottle, Pang, and Venkateswaran identified the class of (column, ro...

We investigate the class of bisymmetric and quasitrivial binary operations on a given set X and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations. We also determine explicitly the sizes of these classes when the set X is finite.

We will investigate so-called commuting operators and their relationship to bisymmetry and domination. In the case of bisymmetric aggregation operators we will show a sufficient condition ensuring that two operators commute, while for bisymmetric aggregation operators with neutral element we will even give a full characterization of commuting n-ary operators by means of unary commuting operators.

Specially structured Linear Complementarity Problems (LCP's) and their solution by the criss{ cross method are examined in this paper. The criss{cross method is known to be nite for LCP's with positive semide nite bisymmetric matrices and with P{matrices. It is also a simple nite algorithm for oriented matroid programming problems. Recently Cottle, Pang and Venkateswaran identi ed the class of ...

In order to solve the complicated process and low efficiency accuracy of solving a class matrix equations, this paper introduces linear saturated system model neural network architecture bisymmetric solution equations. Firstly, equations is constructed determine key problems Secondly, structure characteristic parameters in solution. Then, solved by using backpropagation topology. Finally, norma...