• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.884-889
• /
• 1989

In this paper, a new procedure for selecting weighting matrices in linear discrete time quadratic optimal control problem (LQ-problem) is proposed. In LQ-problems, the quadratic weighting matrices are usually decided on trial and error in order to get a good response. But using the proposed method, the quadratic weights are decided in such a way that all poles of the closed loop system are located in a desired region for good responses as well as for stability and values of the quadratic cost function are kept less then a specified value.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.735-746
• /
• 1999

Based on an active set strategy a method for solving lin-early constrained indefinite quadratic programs to solve the correspond-ing system of equations at each iteration is presented. The algorithm takes two descent directions to strictly decrease the value of objective function and obtains a suitable step to maintain feasibility. Computa-tional results on a range of quadratic test problems are given.

• East Asian mathematical journal
• /
• v.27 no.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.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.1-6
• /
• 2005

In this paper we propose how to simultaneously optimize multiple responses for robust design when data are collected from a combined array. The proposed method is based on the quadratic loss function. An example is illustrated to show the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.35-42
• /
• 1990

This paper deals with a single machine scheduling problem with a quadratic penalty function of completion times. The objective is to find a optimal sequence which minimizes the total penalty. A new type of node elimination procedure and precedence relation is developed that determines the ordering between adjacent jobs and is incorporated into a branch and bound algorithm. In addition, modified penalty function is considered and numerical examples are provided to test the effectiveness of the optimum algorithm.

• Communications for Statistical Applications and Methods
• /
• v.19 no.5
• /
• pp.655-662
• /
• 2012

Classification is an important research field in pattern recognition with high-dimensional predictors. The support vector machine(SVM) is a penalized feature selector and classifier. It is based on the hinge loss function, the non-convex penalty function, and the smoothly clipped absolute deviation(SCAD) suggested by Fan and Li (2001). We developed the algorithm for the multiclass SVM with the SCAD penalty function using the local quadratic approximation. For multiclass problems we compared the performance of the SVM with the $L_1$, $L_2$ penalty functions and the developed method.

• Communications for Statistical Applications and Methods
• /
• v.7 no.3
• /
• pp.767-772
• /
• 2000

Zellner(1994) introduced the notion of a balanced loss function in the context of a general liner model to reflect both goodness of fit and precision of estimation. We study the perspective of unifying a variety of results both frequentist and Bayesian from Poisson distributions. We show that frequentist and Bayesian results for balanced loss follow from and also imply related results for quadratic loss functions reflecting only precision of estimation. Several examples are given for Poisson distribution.

• The Pure and Applied Mathematics
• /
• v.14 no.1 s.35
• /
• pp.23-35
• /
• 2007

We investigate the modified Hyers-Ulam-Rassias stability for the following mixed type functional equation, i.e, cubic or quadratic type functional equation : 9f(x+y)-9f(x-y)+f(6y)=3f(x+3y)-3f(x-3y)+9f(2y).

• Journal of the Korean Data and Information Science Society
• /
• v.16 no.2
• /
• pp.255-261
• /
• 2005

Many designed experiments require the simultaneous optimization of multiple responses. In this paper, we propose how to simultaneously optimize multiple responses for robust design when data are collected from a combined array. The proposed method is based on the quadratic loss function. An example is illustrated to show the proposed method.

• School Mathematics
• /
• v.18 no.1
• /
• pp.127-141
• /
• 2016

This study analyzes modes related to use of graph representation that appears to solve high school students quadratic function problem based on the graph using modes of Chauvat. It was examined the extent of understanding of the quadratic function of students through the flexibility of the representation of the Bannister (2014) from the analysis. As a result, the graph representation mode in which a high school students are mainly used is a nomographic specific mode, when using operational mode, it was found to be an error. The flexibility of Bannister(2014) that were classified to the use of representation from the point of view of the object and the process in the understanding of the function was constrained operation does not occur between the two representations in understanding the function in the process of perspective. Based on these results, the teaching on use graph representation for the students in classroom is required and the study of teaching and learning methods can understand the function from various perspectives is needed.