• 제목/요약/키워드: convex programming problems

검색결과 46건 처리시간 0.022초

A Joint Resource Allocation Scheme for Relay Enhanced Multi-cell Orthogonal Frequency Division Multiple Networks

  • Fu, Yaru;Zhu, Qi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.288-307
    • /
    • 2013
  • This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

Mixed $H_2/H_{\infty}$ Finite Memory Controls for Output Feedback Controls of Discrete-time State-Space Systems

  • Ahn, Choon-Ki;Han, Soo-Hee;Kwon, Wook-Hyun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.529-534
    • /
    • 2005
  • In this paper, a new type of output feedback control, called a $H_2/H_{\infty}$ fnite memory control (FMC), is proposed for deterministic state space systems. Constraints such as linearity, unbiasedness property, and finite memory structure with respect to an input and an output are required in advance to design $H_2/H_{\infty}$ FMC in addition to the performance criteria in both $H_2$ and $H_{\infty}$ sense. It is shown that $H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FMC design problems can be converted into convex programming problems written in terms of linear matrix inequalities (LMIs) with some linear equality constraints. Through simulation study, it is illustrated that the proposed $H_2/H_{\infty}$ FMC is more robust against uncertainties and faster in convergence than the existing $H_2/H_{\infty}$ output feedback control schemes.

  • PDF

Optimum design of lead-rubber bearing system with uncertainty parameters

  • Fan, Jian;Long, Xiaohong;Zhang, Yanping
    • Structural Engineering and Mechanics
    • /
    • 제56권6호
    • /
    • pp.959-982
    • /
    • 2015
  • In this study, a non-stationary random earthquake Clough-Penzien model is used to describe earthquake ground motion. Using stochastic direct integration in combination with an equivalent linear method, a solution is established to describe the non-stationary response of lead-rubber bearing (LRB) system to a stochastic earthquake. Two parameters are used to develop an optimization method for bearing design: the post-yielding stiffness and the normalized yield strength of the isolation bearing. Using the minimization of the maximum energy response level of the upper structure subjected to an earthquake as an objective function, and with the constraints that the bearing failure probability is no more than 5% and the second shape factor of the bearing is less than 5, a calculation method for the two optimal design parameters is presented. In this optimization process, the radial basis function (RBF) response surface was applied, instead of the implicit objective function and constraints, and a sequential quadratic programming (SQP) algorithm was used to solve the optimization problems. By considering the uncertainties of the structural parameters and seismic ground motion input parameters for the optimization of the bearing design, convex set models (such as the interval model and ellipsoidal model) are used to describe the uncertainty parameters. Subsequently, the optimal bearing design parameters were expanded at their median values into first-order Taylor series expansions, and then, the Lagrange multipliers method was used to determine the upper and lower boundaries of the parameters. Moreover, using a calculation example, the impacts of site soil parameters, such as input peak ground acceleration, bearing diameter and rubber shore hardness on the optimization parameters, are investigated.

On the Formulation and Optimal Solution of the Rate Control Problem in Wireless Mesh Networks

  • Le, Cong Loi;Hwang, Won-Joo
    • 한국통신학회논문지
    • /
    • 제32권5B호
    • /
    • pp.295-303
    • /
    • 2007
  • An algorithm is proposed to seek a local optimal solution of the network utility maximization problem in a wireless mesh network, where the architecture being considered is an infrastructure/backbone wireless mesh network. The objective is to achieve proportional fairness amongst the end-to-end flows in wireless mesh networks. In order to establish the communication constraints of the flow rates in the network utility maximization problem, we have presented necessary and sufficient conditions for the achievability of the flow rates. Since wireless mesh networks are generally considered as a type of ad hoc networks, similarly as in wireless multi-hop network, the network utility maximization problem in wireless mesh network is a nonlinear nonconvex programming problem. Besides, the gateway/bridge functionalities in mesh routers enable the integration of wireless mesh networks with various existing wireless networks. Thus, the rate optimization problem in wireless mesh networks is more complex than in wireless multi-hop networks.

A Cloud-Edge Collaborative Computing Task Scheduling and Resource Allocation Algorithm for Energy Internet Environment

  • Song, Xin;Wang, Yue;Xie, Zhigang;Xia, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2282-2303
    • /
    • 2021
  • To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

$H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FIR Filters for Discrete-time State Space Models

  • Lee, Young-Sam;Jung, Soo-Yul;Seo, Joong-Eon;Han, Soo-Hee;Kwon, Wook-Hyun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.401-404
    • /
    • 2003
  • 이 논문에서는 이산형 상태공간 모델에 대한 $H_2$, $H_{\infty}$, 및 혼합 $H_{\infty}$ FIR 필터를 선형행렬부등식(LMI)를 이용하여 제안한다. 제안되는 필터는 FIR 구조로서 $H_2$$H_{\infty}$ 관점에서의 성능기준을 만족함과 더불어 선형성 및 불편향성의 특성을 지니고, 초기 상태에 관한 정보를 필요로 하지 않는다. 그리고 FIR 구조로 인해 기존의 FIR 형태의 필터에 비해 불확실성에 대해 보다 견실하며 빠른 수렴성을 갖는다. 모의 실험을 통해 이러한 장점을 예시한다.

  • PDF