• Title/Summary/Keyword: $\epsilon$-approximate solution

Search Result 4, Processing Time 0.017 seconds

ON BOUNDEDNESS OF $\epsilon$-APPROXIMATE SOLUTION SET OF CONVEX OPTIMIZATION PROBLEMS

  • Kim, Gwi-Soo;Lee, Gue-Myung
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.375-381
    • /
    • 2008
  • Boundedness for the set of all the $\epsilon$-approximate solutions for convex optimization problems are considered. We give necessary and sufficient conditions for the sets of all the $\epsilon$-approximate solutions of a convex optimization problem involving finitely many convex functions and a convex semidefinite problem involving a linear matrix inequality to be bounded. Furthermore, we give examples illustrating our results for the boundedness.

  • PDF

A topological optimization method for flexible multi-body dynamic system using epsilon algorithm

  • Yang, Zhi-Jun;Chen, Xin;Kelly, Robert
    • Structural Engineering and Mechanics
    • /
    • v.37 no.5
    • /
    • pp.475-487
    • /
    • 2011
  • In a flexible multi-body dynamic system the typical topological optimization method for structures cannot be directly applied, as the stiffness varies with position. In this paper, the topological optimization of the flexible multi-body dynamic system is converted into structural optimization using the equivalent static load method. First, the actual boundary conditions of the control system and the approximate stiffness curve of the mechanism are obtained from a flexible multi-body dynamical simulation. Second, the finite element models are built using the absolute nodal coordination for different positions according to the stiffness curve. For efficiency, the static reanalysis method is utilized to solve these finite element equilibrium equations. Specifically, the finite element equilibrium equations of key points in the stiffness curve are fully solved as the initial solution, and the following equilibrium equations are solved using a reanalysis method with an error controlled epsilon algorithm. In order to identify the efficiency of the elements, a non-dimensional measurement is introduced. Finally, an improved evolutional structural optimization (ESO) method is used to solve the optimization problem. The presented method is applied to the optimal design of a die bonder. The numerical results show that the presented method is practical and efficient when optimizing the design of the mechanism.

Global Existence and Ulam-Hyers Stability of Ψ-Hilfer Fractional Differential Equations

  • Kucche, Kishor Deoman;Kharade, Jyoti Pramod
    • Kyungpook Mathematical Journal
    • /
    • v.60 no.3
    • /
    • pp.647-671
    • /
    • 2020
  • In this paper, we consider the Cauchy-type problem for a nonlinear differential equation involving a Ψ-Hilfer fractional derivative and prove the existence and uniqueness of solutions in the weighted space of functions. The Ulam-Hyers and Ulam-Hyers-Rassias stabilities of the Cauchy-type problem is investigated via the successive approximation method. Further, we investigate the dependence of solutions on the initial conditions and their uniqueness using 𝜖-approximated solutions. Finally, we present examples to illustrate our main results.

Performance of a Bayesian Design Compared to Some Optimal Designs for Linear Calibration (선형 캘리브레이션에서 베이지안 실험계획과 기존의 최적실험계획과의 효과비교)

  • 김성철
    • The Korean Journal of Applied Statistics
    • /
    • v.10 no.1
    • /
    • pp.69-84
    • /
    • 1997
  • We consider a linear calibration problem, $y_i = $$\alpha + \beta (x_i - x_0) + \epsilon_i$, $i=1, 2, {\cdot}{\cdot},n$ $y_f = \alpha + \beta (x_f - x_0) + \epsilon, $ where we observe $(x_i, y_i)$'s for the controlled calibration experiments and later we make inference about $x_f$ from a new observation $y_f$. The objective of the calibration design problem is to find the optimal design $x = (x_i, \cdots, x_n$ that gives the best estimates for $x_f$. We compare Kim(1989)'s Bayesian design which minimizes the expected value of the posterior variance of $x_f$ and some optimal designs from literature. Kim suggested the Bayesian optimal design based on the analysis of the characteristics of the expected loss function and numerical must be equal to the prior mean and that the sum of squares be as large as possible. The designs to be compared are (1) Buonaccorsi(1986)'s AV optimal design that minimizes the average asymptotic variance of the classical estimators, (2) D-optimal and A-optimal design for the linear regression model that optimize some functions of $M(x) = \sum x_i x_i'$, and (3) Hunter & Lamboy (1981)'s reference design from their paper. In order to compare the designs which are optimal in some sense, we consider two criteria. First, we compare them by the expected posterior variance criterion and secondly, we perform the Monte Carlo simulation to obtain the HPD intervals and compare the lengths of them. If the prior mean of $x_f$ is at the center of the finite design interval, then the Bayesian, AV optimal, D-optimal and A-optimal designs are indentical and they are equally weighted end-point design. However if the prior mean is not at the center, then they are not expected to be identical.In this case, we demonstrate that the almost Bayesian-optimal design was slightly better than the approximate AV optimal design. We also investigate the effects of the prior variance of the parameters and solution for the case when the number of experiments is odd.

  • PDF