• 제목/요약/키워드: constrained minimization

검색결과 88건 처리시간 0.028초

A constrained minimization-based scheme against susceptibility of drift angle identification to parameters estimation error from measurements of one floor

  • Kangqian Xu;Akira Mita;Dawei Li;Songtao Xue;Xianzhi Li
    • Smart Structures and Systems
    • /
    • 제33권2호
    • /
    • pp.119-131
    • /
    • 2024
  • Drift angle is a significant index for diagnosing post-event structures. A common way to estimate this drift response is by using modal parameters identified under natural excitations. Although the modal parameters of shear structures cannot be identified accurately in the real environment, the identification error has little impact on the estimation when measurements from several floors are used. However, the estimation accuracy falls dramatically when there is only one accelerometer. This paper describes the susceptibility of single sensor identification to modelling error and simulations that preliminarily verified this characteristic. To make a robust evaluation from measurements of one floor of shear structures based on imprecisely identified parameters, a novel scheme is devised to approximately correct the mode shapes with respect to fictitious frequencies generated with a genetic algorithm; in particular, the scheme uses constrained minimization to take both the mathematical aspect and the realistic aspect of the mode shapes into account. The algorithm was validated by using a full-scale shear building. The differences between single-sensor and multiple-sensor estimations were analyzed. It was found that, as the number of accelerometers decreases, the error rises due to insufficient data and becomes very high when there is only one sensor. Moreover, when measurements for only one floor are available, the proposed method yields more precise and appropriate mode shapes, leading to a better estimation on the drift angle of the lower floors compared with a method designed for multiple sensors. As well, it is shown that the reduction in space complexity is offset by increasing the computation complexity.

궤환선형화 가능한 비선형 시스템의 입력제한을 고려한 동적 와인드엎 방지 (A Dynamic Anti-windup Scheme for Input-constrained Feedback Linearizable Nonlinear Systems)

  • 윤성식;박종구;윤태웅
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.534-534
    • /
    • 2000
  • This paper proposes a dynamic compensation scheme for input-constrained feedback linearizable nonlinear systems to cope with the windup phenomenon. Given a feedback linearizing controller for such a nonlinear system designed without considering its input constraint, an additional dynamic compensator is proposed to account for the constraint. This dynamic anti-windup is based on the minimization of a reasonable performance index, and some stability properties of the resulting closed-loop are presented.

  • PDF

Finite Step Method for the Constrained Optimization Problem in Phase Contrast Microscopic Image Restoration

  • Adiya, Enkhbolor;Yadam, Bazarsad;Choi, Heung-Kook
    • Journal of Multimedia Information System
    • /
    • 제1권1호
    • /
    • pp.87-93
    • /
    • 2014
  • The aim of microscopic image restoration is to recover the image by applying the inverse process of degradation, and the results facilitate automated and improved analysis of the image. In this work, we consider the problem of image restoration as a minimization problem of convex cost function, which consists of a least-squares fitting term and regularization terms with non-negative constraints. The finite step method is proposed to solve this constrained convex optimization problem. We demonstrate the convergence of this method. Efficiency and restoration capability of the proposed method were tested and illustrated through numerical experiments.

  • PDF

On a Balanced Classification Rule

  • Kim, Hea-Jung
    • Journal of the Korean Statistical Society
    • /
    • 제24권2호
    • /
    • pp.453-470
    • /
    • 1995
  • We describe a constrained optimal classification rule for the case when the prior probability of an observation belonging to one of the two populations is unknown. This is done by suggesting a balanced design for the classification experiment and constructing the optimal rule under the balanced design condition. The rule si characterized by a constrained minimization of total risk of misclassification; the constraint of the rule is constructed by the process of equation between Kullback-Leibler's directed divergence measures obtained from the two population conditional densities. The efficacy of the suggested rule is examined through two-group normal classification. This indicates that, in case little is known about the relative population sizes, dramatic gains in accuracy of classification result can be achieved.

  • PDF

선형의 자동순정 및 모델링 시스템에 관한 연구 (A Study on the Automatic Fairing and Modeling System of Hull From)

  • 김동준
    • 한국해양공학회지
    • /
    • 제14권2호
    • /
    • pp.121-127
    • /
    • 2000
  • In this paper a new technique of inverse fairing problem for ship hull is proposed. Recently Lu solved the inverse fairing problem for automobile's body that was made by one surface element. In this system however hull surface is constructed by Gregory's composite surface interpolation method. So reflection line at boundary position is used as a tool of solving inverse problem in surface fairing. But the results are not good. The new concepts of Normal vector line and Constrained reflection line are introduced as an alternative tool. Energy minimization method for Normal Vector Line curve net and the inverse method for Constrained Reflection Line by using optimization technique are examined And the final lines from this proposed surface fairing method shows good fairness.

  • PDF

ESPRIT에 의한 공간 채널응답 추정치에 기초를 둔 방향구속 전력 최소화법과 제로포싱 알고리즘의 성능평가 (Performance Analysis of DCMP and ZF based on Spatial Channel Response Estimation by ESPRIT)

  • 정중식;임정빈;안영섭
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2002년도 추계공동학술대회논문집
    • /
    • pp.169-174
    • /
    • 2002
  • 방향구속 전력최소화법(Directionally Constrained Minimization of Power : DCMP)과 제로포싱방법(Zero Forcing : ZF)은 어레이 안테나에 수신된 신호들로부터 채널응답 백터인 Spatial Signature를 추정하고, 이를 이용하여 최적웨이트(Optimal Weight)를 결정함으로써 어레이 출력SINR(Signal to Interference plus Noise Ratio)을 향상시킬 수 있는 알고리즘들로 알려져 있다. 본 논문에서는 이 동국 주변에서 다중산란된 수신신호들이 어레이 안테나에 수신되는 환경에서 DCMP와 ZF방법의 성능을 분석하였다. 이를 위하여 ESPRIT를 이용하여 수신신호들의 도래각(Direction of Arrival: DOA)과 확산각도(Angular Spread: AS)를 추정하여 Spatial Signature를 구한 후, 그 결과치를 이용하여 DCMP와 ZF방법으로 어레이 출력신호를 합성하였다. 모의 실험을 통하여 어레이 출력 SINR 성능을 평가하고 이론저거 성능결과와 비교하였다.

  • PDF

0-1 배낭 제약식을 갖는 오목 함수 최소화 문제의 해법 (An Algorithm for the Concave Minimization Problem under 0-1 Knapsack Constraint)

  • 오세호;정성진
    • 대한산업공학회지
    • /
    • 제19권2호
    • /
    • pp.3-13
    • /
    • 1993
  • In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

  • PDF

전압안정도를 고려한 연속선형계획법 기반 최적조류계산 (Voltage Stability Constrained Optimal Power Flow based on Successive Linear Programming)

  • 배승철;신용선;이병준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.220-223
    • /
    • 2003
  • This paper presents VSCOPF(Votage Stability Constrained Optimal Power Flow) algorithm based on SLP(Successive Linear Programming) to interpret the large scale system. Voltage stability index used to this paper is L index to be presented by function form. The objective function consists of load shedding cost minimization. Voltage stability indicator constraint was incorporated in traditional OPF formulation. as well as the objective function and constraints are linearlized and the optimal problem is performed by SLP(Successive Linear Programming). In this paper, the effect of voltage stability limit constraint is showed in the optimal load curtailment problems. As a result, an optimal solution is calculated to minimize load shedding cost guaranteeing voltage security level. Numerical examples using IEEE 39-bus system is also presented to illustrate the capabilities of the proposed formulation.

  • PDF

Nonlinear section model for analysis of RC circular tower structures weakened by openings

  • Lechman, Marek;Stachurski, Andrzej
    • Structural Engineering and Mechanics
    • /
    • 제20권2호
    • /
    • pp.161-172
    • /
    • 2005
  • This paper presents the section model for analysis of RC circular tower structures based on nonlinear material laws. The governing equations for normal strains due to the bending moment and the normal force are derived in the case when openings are located symmetrically in respect to the bending direction. In this approach the additional reinforcement at openings is also taken into account. The mathematical model is expressed in the form of a set of nonlinear equations which are solved by means of the minimization of the sums of the second powers of the residuals. For minimization the BFGS quasi-Newton and/or Hooke-Jeeves local minimizers suitably modified are applied to take into account the box constraints on variables. The model is verified on the set of data encountered in engineering practice. The numerical examples illustrate the effects of the loading eccentricity and size of the opening on the strains and stresses in concrete and steel in the cross-sections under consideration. Calculated results indicate that the additional reinforcement at the openings increases the resistance capacity of the section by several percent.

THE USE OF MATHEMATICAL PROGRAMMING FOR LINEAR REGRESSION PROBLEMS

  • Park, Sung-Hyun
    • 한국경영과학회지
    • /
    • 제3권1호
    • /
    • pp.75-79
    • /
    • 1978
  • The use of three mathematical programming techniques (quadratic programming, integer quadratic programming and linear programming) is discussed to solve some problems in linear regression analysis. When the criterion is the minimization of the sum of squared deviations and the parameters are linearly constrained, the problem may be formulated as quadratic programming problem. For the selection of variables to find "best" regression equation in statistics, the technique of integer quadratic programming is proposed and found to be a very useful tool. When the criterion of fitting a linear regression is the minimization of the sum of absolute deviations from the regression function, the problem may be reduced to a linear programming problem and can be solved reasonably well.ably well.

  • PDF