• 제목/요약/키워드: optimality

검색결과 663건 처리시간 0.021초

조정점 최적탐색에 의한 Form Parameter 방법에 관한 연구 (A Study on Form Parameter Method by Optimum Vertex Point Search)

  • 김수영;신성철;김덕은
    • 대한조선학회논문집
    • /
    • 제39권4호
    • /
    • pp.60-65
    • /
    • 2002
  • 본 연구는 Form Parameter를 만족하는 선형 생성 과정을 최적화 과정으로 취급하였다. 목적함수는 fairness 기준을 도입하고 설계변수는 B-spline 곡선의 조정점으로 하며 제약조건은 설계자에 의해서 주어지는 기하학적 형상으로 하였다. 최적화 방법은 GA(Genetic Algorithm)와 최적성 기준(optimality criteria)을 병행하였다.

개선된 에너지 함수를 가지는 신경망 기반의 라우팅 알고리즘 (A Neural Network-based Routing Algorithm With an Improved Energy Function)

  • 박동철;금교린
    • 한국통신학회논문지
    • /
    • 제30권2B호
    • /
    • pp.21-26
    • /
    • 2005
  • 효율적인 통신망에서의 라우팅을 위해, 개선된 에너지 함수를 가지는 Hopfield 신경망에 의한 알고리즘이 본 논문에서 제안되었는데, 보다 높은 최적경로 형성과 안정적 수렴의 결과를 목적으로 한다. 20-50 개의 노드를 가지며, 무작위 연결 비용이 인가되는 3,000 개의 통신망에 대한 실험의 결과에서 볼 때, 기존의 신경망을 이용한 알고리즘들이 노드 수가 많은 망 환경에서 수렴하지 않거나, 최적경로가 형성이 되지 않은 경우가 많았지만 제안된 알고리즘은 최적경로 형성에서 기존 알고리즘 보다 약 65%의 개선을 하였고 또한 기존 알고리즘 보다 약 50% 정도 수렴이 잘 되는 것이 확인되었다.

여유 자유도 로봇의 역기구학에 관한 연구 (An Inverse Kinematics of Redundant Manipulators)

  • 조동권;성영휘;정명진
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1993년도 하계학술대회 논문집 A
    • /
    • pp.399-402
    • /
    • 1993
  • In this paper, an inverse kinematics of redundant manipulators is proposed. Optimality-constraint based inverse kinematic algorithms have some problems because those algorithms are based on necessary conditions for optimality. Among the problems, switching from a maximum value to a minimum value may occur and make an inverse kinematic solution unstable while performing a given task. An inverse kinematic solution for protecting from the switchings is suggested. By sufficient conditions for optimality, the configuration space is defined as a set of regions, potentially good configuration region and potentially bad configuration region. Inverse kinematics solution within potentially good configuration region can provide joint trajectories without both singularities and switchings. Through a simulation of tracing a circle, we show the effectiveness of this inverse kinematics.

  • PDF

Optimality Theory in Semantics and the Anaphora Resolution in Korean: An Adumbration

  • Hong, Min-Pyo
    • 한국언어정보학회지:언어와정보
    • /
    • 제6권2호
    • /
    • pp.129-152
    • /
    • 2002
  • This paper argues for a need to adopt a conceptually radical approach to zero anaphora resolution in Korean. It is shown that a number of apparently conflicting constraints, mostly motivated by lexical, syntactic, semantic, and pragmatic factors, are involved in determining the referential identity of zero pronouns in Korean. It is also argued that some of the major concepts of Optimality Theory can provide a good theoretical framework to predict the antecedents to zero pronouns in general. A partial formalization of 07-based constraints at the morpho-syntactic and lexico-semantical level is provided. It is argued that the lexico-semantic restrictions on adjacent expressions play the most important role in the anaphora resolution process along with a variant of the binding principle, formulated in semantic terms. Other pragmatically motivated constraints that incorporate some important intuitions of Centering Theory are proposed too.

  • PDF

OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS

  • Jaiswal, Monika;Mishra, Shashi Kant;Al Shamary, Bader
    • 대한수학회논문집
    • /
    • 제27권2호
    • /
    • pp.411-423
    • /
    • 2012
  • A nondifferentiable nonlinear semi-infinite programming problem is considered, where the functions involved are ${\eta}$-semidifferentiable type I-preinvex and related functions. Necessary and sufficient optimality conditions are obtained for a nondifferentiable nonlinear semi-in nite programming problem. Also, a Mond-Weir type dual and a general Mond-Weir type dual are formulated for the nondifferentiable semi-infinite programming problem and usual duality results are proved using the concepts of generalized semilocally type I-preinvex and related functions.

ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS

  • Lee, Gue-Myung;Lee, Kwang-Baik
    • 대한수학회지
    • /
    • 제44권4호
    • /
    • pp.971-985
    • /
    • 2007
  • A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

ROBUST SEMI-INFINITE INTERVAL-VALUED OPTIMIZATION PROBLEM WITH UNCERTAIN INEQUALITY CONSTRAINTS

  • Jaichander, Rekha R.;Ahmad, Izhar;Kummari, Krishna
    • Korean Journal of Mathematics
    • /
    • 제30권3호
    • /
    • pp.475-489
    • /
    • 2022
  • This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

Empirical Bayes Test for the Exponential Parameter with Censored Data

  • Wang, Lichun
    • Communications for Statistical Applications and Methods
    • /
    • 제15권2호
    • /
    • pp.213-228
    • /
    • 2008
  • Using a linear loss function, this paper considers the one-sided testing problem for the exponential distribution via the empirical Bayes(EB) approach. Based on right censored data, we propose an EB test for the exponential parameter and obtain its convergence rate and asymptotic optimality, firstly, under the condition that the censoring distribution is known and secondly, that it is unknown.

A PSEUDOCONVEX PROGRAMMINA IN A HILBERT SPACE

  • Yoon, Byung-Ho;Kim, In-Soo
    • 대한수학회보
    • /
    • 제23권2호
    • /
    • pp.141-148
    • /
    • 1986
  • In [1], M. Guignard considered a constraint set in a Banach space, which is similar to that in [2] and gave a first order necessary optimality condition which generalized the Kuhn-Tucker conditions [3]. Sufficiency is proved for objective functions which is either pseudoconcave [5] or quasi-concave [6] where the constraint sets are taken pseudoconvex. In this note, we consider a psedoconvex programming problem in a Hilbert space. Constraint set in a Hillbert space being pseudoconvex and the objective function is restrained by an operator equation. Then we use the methods similar to that in [1] and [6] to obtain a necessary and sufficient optimality condition.

  • PDF

불확실한 수율하에서 단일소싱의 최적성 (Optimality of the Sole Sourcing under Random Yield)

  • 박경철;이경식
    • 대한산업공학회지
    • /
    • 제41권3호
    • /
    • pp.324-329
    • /
    • 2015
  • Though the supplier diversification is considered as a vital tool to mitigate the risk due to supply chain disruptions, there are results which show the optimality of the sole sourcing. This paper further generalizes the results to show that the sole sourcing is optimal under very mild conditions. Discussion on why the sole sourcing is optimal is given with the insight on the value of supplier diversification.