• Title/Summary/Keyword: Convex envelope

Search Result 7, Processing Time 0.02 seconds

A LOWER ESTIMATE OF THE BANACH-MAZUR DISTANCES ON THE QUASI-NORMED SPACES

  • Kang, JeongHeung
    • Korean Journal of Mathematics
    • /
    • v.7 no.2
    • /
    • pp.207-213
    • /
    • 1999
  • In this paper we estimate a lower bound of the Banach-Mazur distance between a finite dimensional nonlocally convex space and its Banach envelope space by investigating the properties of the nonlocally convex space and the projection constant which are obtained by factoring the identity operator through $l^k_{\infty}$ on the quasi-normed spaces.

  • PDF

Multi-loop PID Control Method of Brushless DC Motors via Convex Combination Method

  • Kim, Chang-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.72-77
    • /
    • 2017
  • This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

A Concave Function Minimization Algorithm Under 0-1 Knapsack Constraint using Strong Valid Inequalities (유효 절단 부등식을 이용한 오목함수 0-1 배낭제약식 문제의 해법)

  • 오세호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.11-22
    • /
    • 1997
  • The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

  • PDF

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

Maximum Force Limit of velocity-dependent Damping Devices Using Response Estimation Models (응답예측모델을 이용한 속도의존형 감쇠장치의 최대제어력 산정)

  • Lee, Sang-Hyun;Park, Ji-Hun;Min, Kyung-Won
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.60-65
    • /
    • 2003
  • In this study, for estimating responses of a controlled structure and determining the maximum control force of velocity-dependent damping devices, three estimation models such as Fourier envelope convex model, probability model, and Newmark design spectrum are used. For this purpose, a procedure proposed by Gupta (1990) for estimating spectral velocity using pseudo-spectral velocity which is given by the estimation models is used and modified to consider the effects of increased damping ratio by the damping device. Time history results indicate that Newmark design spectrum gives the best estimation of maximum control force for over all period structures.

  • PDF

Optimal wind-induced load combinations for structural design of tall buildings

  • Chan, C.M.;Ding, F.;Tse, K.T.;Huang, M.F.;Shum, K.M.;Kwok, K.C.S.
    • Wind and Structures
    • /
    • v.29 no.5
    • /
    • pp.323-337
    • /
    • 2019
  • Wind tunnel testing technique has been established as a powerful experimental method for predicting wind-induced loads on high-rise buildings. Accurate assessment of the design wind load combinations for tall buildings on the basis of wind tunnel tests is an extremely important and complicated issue. The traditional design practice for determining wind load combinations relies partly on subjective judgments and lacks a systematic and reliable method of evaluating critical load cases. This paper presents a novel optimization-based framework for determining wind tunnel derived load cases for the structural design of wind sensitive tall buildings. The peak factor is used to predict the expected maximum resultant responses from the correlated three-dimensional wind loads measured at each wind angle. An optimized convex hull is further developed to serve as the design envelope in which the peak values of the resultant responses at any azimuth angle are enclosed to represent the critical wind load cases. Furthermore, the appropriate number of load cases used for design purposes can be predicted based on a set of Pareto solutions. One 30-story building example is used to illustrate the effectiveness and practical application of the proposed optimization-based technique for the evaluation of peak resultant wind-induced load cases.

Maximum Control Force of Velocity-dependent Damping Devices Using Response Estimation Models (응답예측모델을 이용한 속도의존형 감쇠장치의 최대제어력 산정)

  • 이상현;민경원
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.14 no.6
    • /
    • pp.503-511
    • /
    • 2004
  • In this study, for estimating responses of a controlled structure and determining the maximum control force of velocity-dependent damping devices, three estimation models such as Fourier envelope convex model, probability model, and Newmark design spectrum are used. For this purpose, a procedure is proposed for estimating actual velocity using pseudo-velocity and this procedure considers the effects of damping ratio increased by the damping device. Time history results indicate that actual velocity should be used for estimating accurate maximum control force of damping device and Newmark design spectrum modified by the proposed equation gives the best estimation results for over all period structures.