• Title/Summary/Keyword: Closed and convex

Search Result 147, Processing Time 0.031 seconds

AN APPLICATION OF THE STRING AVERAGING METHOD TO ONE-SIDED BEST SIMULTANEOUS APPROXIMATION

  • Rhee, Hyang-Joo
    • The Pure and Applied Mathematics
    • /
    • v.10 no.1
    • /
    • pp.49-56
    • /
    • 2003
  • For (equation omitted) be an ordered $\ell$(t)-tuple of numbers in{1,2, …,$\ell$}and let Tt be chosen from a finite composition of orthogonal projections (equation omitted) acting on the normed linear space $C_1$(X) to closed convex subset $S(fi_{j}\;^{t})$ respectively. In this paper, we study the convergence of the sequence (equation omitted) where (equation omitted).

  • PDF

Delay-dependent Guaranteed Cost Control for Uncertain Time Delay System

  • Lee, In-Beum;Choi, Jin-Young
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.62.4-62
    • /
    • 2001
  • In this paper, we propose a delay-dependent guaranteed cost controller design method for uncertain linear systems with time delay. The uncertainty is norm bounded and time-varying. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, sufficient condition, which guarantees that the closed-loop system is asymptotically stable and the upper bound value of the closed-loop cost function is not more than a specied one, is derived in terms of Linear Matrix Inequalities(LMIs) that can be solved sufficiently. A convex optimization problem can be formulated to design a guaranteed cost controller, which minimizes the upper bound value of the cost function. Numerical examples show the activeness of the proposed method.

  • PDF

Robust Stabilization of Decentralized Dynamic Surface Control for a Class of Interconnected Nonlinear Systems

  • Song, Bong-Sob
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.138-146
    • /
    • 2007
  • The analysis and design method for achieving robust stabilization of Decentralized Dynamic Surface Control (DDSC) is presented for a class of interconnected nonlinear systems. While a centralized design approach of DSC was developed in [1], the decentralized approach to deal with large-scale interconnected systems is proposed under the assumption that interconnected functions among subsystems are unknown but bounded. To provide a closed-loop form with provable stability properties, augmented error dynamics for N nonlinear subsystems with DDSC are derived. Then, the reachable set for errors of the closed-loop systems will be approximated numerically in the form of an ellipsoid in the framework of convex optimization. Finally, a numerical algorithm to calculate the $L_2$ gain of the augmented error dynamics is presented.

Mixed $L_1/H_{\infty}$ Suboptimal Control: A LMI Approach (LMI를 이용한 $L_1/H_{\infty}$ 준최적 제어기법)

  • Chun, K.H.;Noh, D.J.;Seo, J.H.
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1131-1133
    • /
    • 1996
  • In this paper, we consider the mixed $L_1/H_{\infty}$ problems of finding internally stabilizing controllers which minimize the peak-to-peak gain of a certain closed loop transfer function with $H_{\infty}$-norm constraint on other closed loop transfer function(or vise versa). This problem is a useful framework for designing a controller with the norm constraints upon time and frequency domain. We formulate the mixed $L_1/H_{\infty}$ problem as LMI problems by using the reachable set. This paper offers the sufficient condition for the existence of suboptimal state feedback controller, and shows that suboptimal solution can be obtained by solving a finite-dimensional convex optimization and a line search.

  • PDF

GENERALIZED SEMI-CONVEXITY FOR NON-DIFFERENTIABLE PLANAR SHAPES

  • Choi, Sung-Woo
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.3
    • /
    • pp.37-41
    • /
    • 2007
  • The semi-convexity for planar shapes has been recently introduced in [2]. As a generalization of the convextiy, semi-convexity is closed under the Minkowski sum. But the definition of semi-convexity requires that the shape boundary should satifisfy a differentiability condition $C^{1:1}$, which means that it should be possible to take the normal vector field along the domain's extended boundary. In view of the fact that the semi-convextiy is a most natural generalization of the convexity in many respects, this is a severe restriction for the semi-convexity, since the convexity requires no such a priori differentiability condition. In this paper, we generalize the semi-convexity to the closure of the class of semi-convex $\mathcal{M}$-domains for any Minkowski class $\mathcal{M}$, and show that this generalized semi-convexity is also closed under Minkowski sum.

  • PDF

Analysis of the Super-Cavitating Flow Around 2-Dimensional Hydrofoil (2차원 날개 주위의 초월공동 유동 해석)

  • 조충호;김건도;김종운;이창섭
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.41 no.2
    • /
    • pp.12-20
    • /
    • 2004
  • In this study, a linearized super-cavitation theory was applied in order to analyse the performance of the 2-dimensional foils. For flat plate with non-thickness, the numerical results correlated very well with Nishiyama's theoretical results for closed cavitation model. For plano-convex section, the numerical results correlated very well with Wade's experimental data. The new lifting surface procedure, developed and validated in this study, is generally considered applicable to the performance analyses of the super-cavitating propeller and trans-cavitating propeller.

FUNCTION ALGEBRAS ON BIDISKS

  • Chi, Kieu Phuong;Dieu, Nguyen Quang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.2
    • /
    • pp.235-247
    • /
    • 2012
  • We study sufficient conditions for function algebras generated by four smooth functions on a small closed bidisk near the origin in $\mathbb{C}$ to coincide with the space of continuous functions on the bidisk. This problem in one dimension has been studied by De Paepe and the second name author.

Delay-dependent Guaranteed Cost Control for Uncertain Time-delay Systems (불확실 시간지연 시스템에 대한 지연량을 고려한 성능보장 제어)

  • 이영삼;문영수;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.13-13
    • /
    • 2000
  • This paper considers delay-dependent guaranteed cost control for uncertain time-delay systems with norm-bounded parametric uncertainties. A new delay-dependent condition for the existence of the guaranteed cost control law is presented in terms of linear matrix inequalities (LMI). An algorithm involving convex optimization is proposed to design a controller which guarantees the suboptimal minimum of the guaranteed cost of the closed-loop system for all admissible uncertainties.

  • PDF

Optimal User Density and Power Allocation for Device-to-Device Communication Underlaying Cellular Networks

  • Yang, Yang;Liu, Ziyang;Min, Boao;Peng, Tao;Wang, Wenbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.483-503
    • /
    • 2015
  • This paper analyzes the optimal user density and power allocation for Device-to-Device (D2D) communication underlaying cellular networks on multiple bands with the target of maximizing the D2D transmission capacity. The entire network is modeled by Poisson point process (PPP) which based on stochastic geometry. Then in order to ensure the outage probabilities of both cellular and D2D communication, a sum capacity optimization problem for D2D system on multiple bands is proposed. Using convex optimization, the optimal D2D density is obtained in closed-form when the D2D transmission power is determined. Next the optimal D2D transmission power is obtained in closed-form when the D2D density is fixed. Based on the former two conclusions, an iterative algorithm for the optimal D2D density and power allocation on multiple bands is proposed. Finally, the simulation results not only demonstrate the D2D performance, density and power on each band are constrained by cellular communication as well as the interference of the entire system, but also verifies the superiority of the proposed algorithm over sorting-based and removal algorithms.