• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11A
• /
• pp.878-891
• /
• 2011

We consider the throughput-maximization problem for both the up- and downlink in a wireless network with interference channels. For this purpose, we design an iterative and distributive uplink algorithm based on Lagrangian relaxation. Using the uplink power prices and network duality, we achieve throughput-maximization in the dual downlink that has a symmetric channel and an equal power budget compared to the uplink. The network duality we prove here is a generalized version of previous research [10], [11]. Computational tests show that the performance of the up- and downlink throughput for our algorithms is close to the optimal value for the channel orthogonality factor, ${\theta}{\in}$(0.5, 1]. On the other hand, when the channels are slightly orthogonal (${\theta}{\in}$(0, 0.5]), we observe some throughput degradation in the downlink. We have extended our analysis to the real downlink that has a nonsymmetric channel and an unequal power budget compared to the uplink. It is shown that the modified duality-based approach is thoroughly applied to the real downlink. Considering the complexity of the algorithms in [6] and [18], we conclude that these results are quite encouraging in terms of both performance and practical applicability of the generalized duality theorem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Environmental and Resource Economics Review
• /
• v.22 no.3
• /
• pp.499-520
• /
• 2013

This study proposes an iterative approach to the estimation of the marginal abatement costs of undesirable outputs by computing the slope of the efficient production possibilities frontier on the basis of the efficient projection points generated by the directional output distance function approach due to Fare et al. (2005) based on duality theory. In case of the latter methodology, the estimated marginal abatement costs differ significantly depending on the choice of the directional output vector. In addition, depending on the curvature of the underlying PPF the efficient projection points may be located at a significant distance away from their actually observed counterparts. While it would be more logical to estimate marginal abatement costs as a PPF slope at a point corresponding to the actually observed emissions level, the methodology based on duality theory is likely to produce unstable results due to the problems associated with applying the theorem of implicit function differentiation. Since our methodology is not based on duality theory, our results are immune to both of these problems. We apply our methodology to a sample of Western European countries for the period of 1995-2011 to illustrate our approach.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.13-23
• /
• 2009

Some strong convergence theorems of explicit iteration scheme for asymptotically nonexpansive semi-groups in Banach spaces are established. The results presented in this paper extend and improve some recent results in [T. Suzuki. On strong convergence to common fixed points of nonexpansive semigroups in Hilbert spaces, Proc. Amer. Math. Soc. 131(2002)2133-2136; H. K. Xu. A strong convergence theorem for contraction semigroups in Banach spaces, Bull. Aust. Math. Soc. 72(2005)371-379; N. Shioji and W. Takahashi. Strong convergence theorems for continuous semigroups in Banach spaces, Math. Japonica. 1(1999)57-66; T. Shimizu and W. Takahashi. Strong convergence to common fixed points of families of nonexpansive mappings, J. Math. Anal. Appl. 211(1997)71-83; N. Shioji and W. Takahashi. Strong convergence theorems for asymptotically nonexpansive mappings in Hilbert spaces, Nonlinear Anal. TMA, 34(1998)87-99; H. K. Xu. Approximations to fixed points of contraction semigroups in Hilbert space, Numer. Funct. Anal. Optim. 19(1998), 157-163.]

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1992.03a
• /
• pp.159-176
• /
• 1992

Limit analysis has been rendered versatile in many problems such as structural problems and metal forming problems. In metal forming analysis, a slip-line method and an upper bound method approach to limit solutions is considered as the most challenging areas. In the present work, a general algorithm for limit solutions of plastic flow is developed with the use of finite element limit analysis. The algorithm deals with a generalized Holder inequality, a duality theorem, and a combined smoothing and successive approximation in addition to a general procedure for finite element analysis. The algorithm is robust such that from any initial trial solution, the first iteration falls into a convex set which contains the exact solution(s) of the problem. The idea of the algorithm for limit solution is extended from rigid/perfectly-plastic materials to work-hardening materials by the nature of the limit formulation, which is also robust with numerically stable convergence and highly efficient computing time.

• Communications of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.401-415
• /
• 2020

It is well-known that if char𝕜 = 0, then an Artinian monomial complete intersection quotient 𝕜[x₁, …, x_n]/(x₁^a₁, …, x_n^a_n) has the strong Lefschetz property in the narrow sense, and it is decomposed by the direct sum of irreducible 𝖘𝖑₂-modules. For an Artinian ring A = 𝕜[x₁, x₂, x₃]/(x₁⁶, x₂⁶, x₃⁶), by the Schur-Weyl duality theorem, there exist 56 trivial representations, 70 standard representations, and 20 sign representations inside A. In this paper we find an explicit basis for A, which is compatible with the S₃-module structure.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.1
• /
• pp.65-70
• /
• 1981

L.G. Khachiyan's algorithm for solving a system of strict (or open) linear inequalities with integral coefficients is described. This algorithm is based on the construction of a sequence of ellipsoids in R$^n$ of decreasing n-dimensional volume and contain-ing feasible region. The running time of the algorithm is polynomial in the number of bits of computer core memory required to store the coefficients. It can be applied to solve linear programming problems in polynomially bounded time by the duality theorem of the linear programming problem. But it is difficult to use in solving practical problems. Because it requires the computation of a square roots, besides other arithmatic operations, it is impossible to do these computations exactly with absolute precision.

• Journal of the Korean Society for Precision Engineering
• /
• v.8 no.3
• /
• pp.93-104
• /
• 1991

Limit analysis is based on the duality theorem which equates the least upper bound to the greatest lower bound. In this study, limit analysis of axisymmetric forming problem with workhardening materials is formulated by minimizing the upper bound functional and finite element program is developed for forward estrusion. Limit loads, velocity and flow line fields are directly obtained under various process conditions and deformation characteristics such as strains, strain rates and grid distortion are obtained from the optimum velocity components by numerical calculation. The experimental observation was carried out for extrusion and compared with computed results. The good agreement between theoretical and experimental results is shown that the developed programming is very effective for the analysis of axisymmetric extrusion.