• 한국음향학회지
• /
• 제34권1호
• /
• pp.82-91
• /
• 2015

본 논문에서는 음성 채널을 통해 데이터를 전송하기 위한 데이터 모뎀의 코드북 설계 방법에 대해 기술하였다. 제안한 코드북 설계 방법은 minimax 최적화 기법을 이용하여 탐색 공간에 분포하는 심볼들 중 최대 중첩을 갖는 심볼들의 중첩을 최소화하도록 하는 방법이다. 제안한 방법에 따라 설계된 코드북을 적용한 데이터 전송 시스템을 제시하였으며, 모의 실험과 실제 이동통신망 적용 실험을 통해 제안한 방법의 성능을 평가하였다.

• 대한수학회보
• /
• 제50권5호
• /
• pp.1639-1650
• /
• 2013

In this paper, a class of set-valued mappings is introduced, which is called uniformly same-order. For this sort of mappings, some minimax problems, in which the minimization and the maximization of set-valued mappings are taken in the sense of vector optimization, are investigated without any hypotheses of convexity.

• Journal of applied mathematics & informatics
• /
• 제37권3_4호
• /
• pp.201-205
• /
• 2019

This note provides the solution equivalence of general minimum variance and minimax disparity problems for OWA operator. This result generalize a main theorem of Liu [International Journal of Approximate Reasoning, 48 (2008) 598-627.]

• Structural Engineering and Mechanics
• /
• 제68권5호
• /
• pp.549-561
• /
• 2018

Sobol method is applied as a powerful variance decomposition technique in the field of global sensitivity analysis (GSA). The paper is devoted to increase convergence speed of the extracted Sobol indices using a new proposed sampling technique called genetic based Latine hypercube sampling (GBLHS). This technique is indeed an improved version of restricted Latine hypercube sampling (LHS) and the optimization algorithm is inspired from genetic algorithm in a new approach. The new approach is based on the optimization of minimax value of LHS arrays using manipulation of array indices as chromosomes in genetic algorithm. The improved Sobol method is implemented to perform factor prioritization and fixing of an uncertain comprehensive high speed rotor-bearing system. The finite element method is employed for rotor-bearing modeling by considering Eshleman-Eubanks assumption and interaction of axial force on the rotor whirling behavior. The performance of the GBLHS technique are compared with the Monte Carlo Simulation (MCS), LHS and Optimized LHS (Minimax. criteria). Comparison of the GBLHS with other techniques demonstrates its capability for increasing convergence speed of the sensitivity indices and improving computational time of the GSA.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.45.5-45
• /
• 2002

In this paper, a quasi-deadbeat minimax estimation (QME) is proposed as a new class of time-domain parameter estimations for deterministic generic linear models. Linearity, quasi-deadbeat property, FIR structure, and independency of the initial parameter information will be required in advance, in addition to a new performance criterion of a worst case gain between the disturbances and the current estimation error. The proposed QME is obtained in a closed form by directly solving an optimization problem. The QME is represented in both a batch form and an iterative form. A fast algorithm for the suggested estimation is also presented, which is remarkable in view...

• Nonlinear Functional Analysis and Applications
• /
• 제29권3호
• /
• pp.673-710
• /
• 2024

In this paper, we propose a modified Halpern's iterative scheme developed from a sequence of a new class of enriched nonspreading mappings and an enriched nonexpansive mapping in the setup of a real Hilbert space. Moreover, we prove strong convergence theorem of the proposed method under mild conditions on the control parameters. Also, we obtain some basic properties of our new class of enriched nonspreading mappings.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.474-477
• /
• 1996

In this paper, a numerical method is developed to solve the 2 dimensional missile/target persuit-evasion game. The numerical solver for the problem is composed of two parts: parametrization of the kinematic equations of motion using collocation and optimization of the parametrized minimax problem using a nonlinear programming. A numerical example is solved to verify the performance of the proposed numerical scheme.

• Industrial Engineering and Management Systems
• /
• 제12권1호
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• 산업기술연구
• /
• 제20권B호
• /
• pp.27-34
• /
• 2000

The definition of flatness is given by ISO, ANSI, KS, etc. but those standards don't mention about the specific methods for the flatness. So various solution models that are based on the Minimum Zone Method have been proposed as an optimization problem for the minimax curve fitting. But it has been rare to compare some optimization algorithms to make a guideline for choosing better algorithms in this field. Hence this paper examined and compared Genetic Algorithm and Simplex Method to the evaluation of flatness. As a result, Genetic Algorithm gave the better or equal flatness than Simplex Method but it has the inefficiency caused from the large number of iteration. Therefore, in the future, another researches about alternative algorithms including Hybrid Genetic Algorithm should be achieved to improve the efficiency of Genetic Algorithm for the evaluation of flatness.

• 한국수자원학회논문집
• /
• 제50권3호
• /
• pp.191-200
• /
• 2017

본 연구에서는 부정류 계산모형의 안정적인 매개변수를 선정하기 위하여, 다수 지점의 관측치를 고려한 모형보정의 결과로부터 얻은 파레토 최적화와 최소최대 후회도 방법(minimax regret approach, MRA)을 결합하는 방법을 제안하였다. 여러 지점의 관측치를 고려한 모형의 보정은 다목적 최적화 문제로서, 통합접근법을 적용하여 최적해를 구하였다. 통합접근법은 여러 지점에 대한 가중치를 결합하여 하나의 목적함수를 얻고, 여러 번의 개별 최적화를 수행함으로써 다수의 파레토 최적해들을 구하는 방법이다. 이때 유량에 따른 조도계수의 가변성을 나타내는 두 개의 매개변수로 구성된 관계식을 이용하여 두 구간에 대한 매개변수들을 모형의 추정 대상 매개변수로서 최적화하였다. 이후 각기 다른 홍수사상에 대해 보정과 검증을 수행하였으며 각각에 대한 평가지표의 후회도를 정량화하였고 이를 결합한 결합후회도를 산정하였다. 이를 기준으로 파레토 최적해들의 순위를 결정하였다. 계산결과 추정된 모형의 가변조도계수와 그로부터 얻은 두 개 지점에서의 표준화된 RMSE들은 두 지점에 대한 가중치의 조합에 따라 선택되는 매개변수 값에 따라 달라짐을 알 수 있었다. 본 연구에서 제시한 방법은 수문 및 수리모형의 다수의 관측지점의 자료를 이용한 매개변수 산정문제에 있어서 안정적인 해를 도출할 수 있다.