Stabilizing relaxed nonlinear fma yields a (combinatorial) optimizer
MetadataShow full item record
CitationUYKAN, Z. (2012). Stabilizing relaxed nonlinear fma yields a (combinatorial) optimizer, In HUANG, T., ZENG, Z., Li, C, LEUNG, C.S. (eds) Lecture Notes in Computer Science, Vol. 7663, pp. 416-423. https://dx.doi.org/10.1007/978-3-642-34475-6_50
In this paper, we focus on so-called nonlinear and unfeasible FMA (Foschini-Miljanic Algorithm) case, where the system matrix is unfeasible and the transmit powers are limited. We stabilize the nonlinear dynamic system by a normalization term, as in Oja's approach for his model. We draw various conclusions regarding the linear and nonlinear cases: i) In linear case, we show that the SINRs in the stabilized linear wireless network converge to some constants which are inversely related to the dominant eigenvalue of normalized link gain matrix. ii) In nonlinear case, we show that the proposed nonlinear network, which includes also Oja's principal component analyzer as a special case, can be applied to solving (combinatorial) optimization problems. The performance of the proposed network is examined in channel allocation problem in cellular radio systems, which is NP complete, and in content-addressable memory design problem. The simulation results confirm the effectiveness and the superiority of the proposed nonlinear network as compared to the Hopfield Neural Network for the very same weight matrices in optimization problems.