• 제목/요약/키워드: semidefinite programming

검색결과 22건 처리시간 0.015초

볼록형 최적화기법을 이용한 LQ-서보 설계 방법 (II) 시간 영역에서의 접근 (LQ-servo Design Method Using Convex Optimization(II) Time Domain Approach)

  • 김상엽;서병설
    • 한국통신학회논문지
    • /
    • 제25권6A호
    • /
    • pp.855-861
    • /
    • 2000
  • 본 논문은 시간 영역에서의 접근 방법에 기초하여 LQ-서보형 PI 제어기 설계 기법을 개발하였다. 이러한 연구의 동기가 된것은 주파수 영역에서 개발된 기존의 방법이 시간영역의 설계사양들을 잘 만족하지 않기 때문이다. 본 논문에서 개발된 기법은 라그랑지 곱셈기, 쌍대개념, 반한정 프로그래밍을 포함하는 볼록형최적화 기법에 기반을 둔다.

  • PDF

Robust Transceiver Designs in Multiuser MISO Broadcasting with Simultaneous Wireless Information and Power Transmission

  • Zhu, Zhengyu;Wang, Zhongyong;Lee, Kyoung-Jae;Chu, Zheng;Lee, Inkyu
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.173-181
    • /
    • 2016
  • In this paper, we address a new robust optimization problem in a multiuser multiple-input single-output broadcasting system with simultaneous wireless information and power transmission, where a multi-antenna base station (BS) sends energy and information simultaneously to multiple users equipped with a single antenna. Assuming that perfect channel-state information (CSI) for all channels is not available at the BS, the uncertainty of the CSI is modeled by an Euclidean ball-shaped uncertainty set. To optimally design transmit beamforming weights and receive power splitting, an average total transmit power minimization problem is investigated subject to the individual harvested power constraint and the received signal-to-interference-plus-noise ratio constraint at each user. Due to the channel uncertainty, the original problem becomes a homogeneous quadratically constrained quadratic problem, which is NP-hard. The original design problem is reformulated to a relaxed semidefinite program, and then two different approaches based on convex programming are proposed, which can be solved efficiently by the interior point algorithm. Numerical results are provided to validate the robustness of the proposed algorithms.