• 제목/요약/키워드: quadratic optimization problem

검색결과 164건 처리시간 0.018초

ON DUALITY FOR NONCONVEX QUADRATIC OPTIMIZATION PROBLEMS

  • Kim, Moon-Hee
    • East Asian mathematical journal
    • /
    • 제27권5호
    • /
    • pp.539-543
    • /
    • 2011
  • In this paper, we consider an optimization problem which consists a nonconvex quadratic objective function and two nonconvex quadratic constraint functions. We formulate its dual problem with semidefinite constraints, and we establish weak and strong duality theorems which hold between these two problems. And we give an example to illustrate our duality results. It is worth while noticing that our weak and strong duality theorems hold without convexity assumptions.

On the numerical assessment of the separation zones in semirigid column base plate connections

  • Baniotopoulos, C.C.
    • Structural Engineering and Mechanics
    • /
    • 제2권3호
    • /
    • pp.295-309
    • /
    • 1994
  • The present paper concerns the mathematical study and the numerical treatment of the problem of semirigid connections in bolted steel column base plates by taking into account the possibility of appearance of separation phenomena on the contact surface under certain loading conditions. In order to obtain a convenient discrete form to simulate the structural behaviour of a steel column base plate, the continuous contact problem is first formulated as a variational inequality problem or, equivalently, as a quadratic programming problem. By applying an appropriate finite element scheme, the discrete problem is formulated as a quadratic optimization problem which expresses, from the standpoint of Mechanics, the principle of minimum potential energy of the semirigid connection at the state of equilibrium. For the numerical treatment of this problem, two effective and easy-to-use solution strategies based on quadratic optimization algorithms are proposed. This technique is illustrated by means of a numerical application.

Quasiconcave Bilevel Programming Problem

  • Arora S.R.;Gaur Anuradha
    • Management Science and Financial Engineering
    • /
    • 제12권1호
    • /
    • pp.113-125
    • /
    • 2006
  • Bilevel programming problem is a two-stage optimization problem where the constraint region of the first level problem is implicitly determined by another optimization problem. In this paper we consider the bilevel quadratic/linear fractional programming problem in which the objective function of the first level is quasiconcave, the objective function of the second level is linear fractional and the feasible region is a convex polyhedron. Considering the relationship between feasible solutions to the problem and bases of the coefficient submatrix associated to variables of the second level, an enumerative algorithm is proposed which finds a global optimum to the problem.

Efficient Approximation Method for Constructing Quadratic Response Surface Model

  • Park, Dong-Hoon;Hong, Kyung-Jin;Kim, Min-Soo
    • Journal of Mechanical Science and Technology
    • /
    • 제15권7호
    • /
    • pp.876-888
    • /
    • 2001
  • For a large scaled optimization based on response surface methods, an efficient quadratic approximation method is presented in the context of the trust region model management strategy. If the number of design variables is η, the proposed method requires only 2η+1 design points for one approximation, which are a center point and tow additional axial points within a systematically adjusted trust region. These design points are used to uniquely determine the main effect terms such as the linear and quadratic regression coefficients. A quasi-Newton formula then uses these linear and quadratic coefficients to progressively update the two-factor interaction effect terms as the sequential approximate optimization progresses. In order to show the numerical performance of the proposed method, a typical unconstrained optimization problem and two dynamic response optimization problems with multiple objective are solved. Finally, their optimization results compared with those of the central composite designs (CCD) or the over-determined D-optimality criterion show that the proposed method gives more efficient results than others.

  • PDF

OPTIMIZATION AND IDENTIFICATION FOR THE NONLINEAR HYPERBOLIC SYSTEMS

  • Kang, Yong-Han
    • East Asian mathematical journal
    • /
    • 제16권2호
    • /
    • pp.317-330
    • /
    • 2000
  • In this paper we consider the optimal control problem of both operators and parameters for nonlinear hyperbolic systems. For the identification problem, we show that for every value of the parameter and operators, the optimal control problem has a solution. Moreover we obtain the necessary conditions of optimality for the optimal control problem on the system.

  • PDF

Quadratic 복수 컨테이너 적재 문제에 관한 연구 (A Study on the Quadratic Multiple Container Packing Problem)

  • 여기태;석상문;이상욱
    • 한국경영과학회지
    • /
    • 제34권3호
    • /
    • pp.125-136
    • /
    • 2009
  • The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

동적기하프로그램을 활용한 이차곡선 최적화 문제해결에 관한 연구 (A Study on the Optimization Problem Solving utilizing the Quadratic Curve using the Dynamic Geometry Software)

  • 김정수;전보현;정영우;김부윤;이양
    • East Asian mathematical journal
    • /
    • 제30권2호
    • /
    • pp.149-172
    • /
    • 2014
  • The problems of optimization addressed in the high school curriculum are usually posed in real-life contexts. However, because of the instructional purposes, problems are artificially constructed to suit computation, rather than to reflect real-life problems. Those problems have thus limited use for teaching 'practicalities', which is one of the goals of mathematics education. This study, by utilizing 'GeoGebra', suggests the optimization problem solving related to the quadratic curve, using the contour-line method which contemplates the quadratic curve changes successively. By considering more realistic situations to supplement the limit which deals only with numerical and algebraic approach, this attempt will help students to be aware of the usefulness of mathematics, and to develop interests in mathematics, as well as foster students' integrated thinking abilities across units. And this allows students to experience a variety of math.

AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS

  • Ryang, Yong Joon
    • Korean Journal of Mathematics
    • /
    • 제4권1호
    • /
    • pp.7-16
    • /
    • 1996
  • The optimization problems with quadratic constraints often appear in various fields such as network flows and computer tomography. In this paper, we propose an algorithm for solving those problems and prove the convergence of the proposed algorithm.

  • PDF

최대엔트로피법을 이용한 역열전도문제의 해석 (Analysis of an Inverse Heat Conduction Problem Using Maximum Entropy Method)

  • 김선경;이우일
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 춘계학술대회논문집B
    • /
    • pp.144-147
    • /
    • 2000
  • A numerical method for the solution of one-dimensional inverse heat conduction problem is established and its performance is demonstrated with computational results. The present work introduces the maximum entropy method in order to build a robust formulation of the inverse problem. The maximum entropy method finds the solution that maximizes the entropy functional under given temperature measurement. The philosophy of the method is to seek the most likely inverse solution. The maximum entropy method converts the inverse problem to a non-linear constrained optimization problem of which constraint is the statistical consistency between the measured temperature and the estimated temperature. The successive quadratic programming facilitates the maximum entropy estimation. The gradient required fur the optimization procedure is provided by solving the adjoint problem. The characteristic feature of the maximum entropy method is discussed with the illustrated results. The presented results show considerable resolution enhancement and bias reduction in comparison with the conventional methods.

  • PDF

평면상의 점들에 대한 조각적 이차 다항식 곡선 맞추기 (Fitting a Piecewise-quadratic Polynomial Curve to Points in the Plane)

  • 김재훈
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제36권1호
    • /
    • pp.21-25
    • /
    • 2009
  • 본 논문에서 우리는 평면상에 점들이 주어지는 경우에, 조각적 이차 다항식 곡선으로 맞추는 문제를 다룬다. 곡선은 이차 다항식 선분들로 이루어지고, 하나의 선분은 두 점 사이를 연결한다. 하지만 이 곡선은 점들의 부분집합만을 지나고, 지나지 못하는 점들에 대해서는 $L^{\infty}$거리로 에러를 측정한다. 이 문제에 대해서 우리는 두 가지 최적화 문제를 생각한다. 첫째로 허용 가능한 에러의 범위가 주어지고, 곡선 선분의 개수를 줄이는 문제이고, 둘째로 선분의 개수가 주어지고, 에러를 줄이는 문제이다. 주어진 점들의 개수 n에 대해서, 우리는 첫번째 문제에 대한 $O(n^2)$ 알고리즘과 두번째 문제에 대한 $O(n^3)$ 알고리즘을 제안한다.