• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.127-133
• /
• 2012

We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

• Asian-Australasian Journal of Animal Sciences
• /
• v.31 no.10
• /
• pp.1670-1676
• /
• 2018

Objective: This study was conducted to enable on-line prediction of primal and commercial cut weights in Korean slaughter pigs by AutoFom III, which non-invasively scans pig carcasses early after slaughter using ultrasonic sensors. Methods: A total of 162 Landrace, Yorkshire, and Duroc (LYD) pigs and 154 LYD pigs representing the yearly Korean slaughter distribution were included in the calibration and validation dataset, respectively. Partial least squares (PLS) models were developed for prediction of the weight of deboned shoulder blade, shoulder picnic, belly, loin, and ham. In addition, AutoFom III's ability to predict the weight of the commercial cuts of spare rib, jowl, false lean, back rib, diaphragm, and tenderloin was investigated. Each cut was manually prepared by local butchers and then recorded. Results: The cross-validated prediction accuracy ($R^2cv$) of the calibration models for deboned shoulder blade, shoulder picnic, loin, belly, and ham ranged from 0.77 to 0.86. The $R^2cv$ for tenderloin, spare rib, diaphragm, false lean, jowl, and back rib ranged from 0.34 to 0.62. Because the $R^2cv$ of the latter commercial cuts were less than 0.65, AutoFom III was less accurate for the prediction of those cuts. The root mean squares error of cross validation calibration (RMSECV) model was comparable to the root mean squares error of prediction (RMSEP), although the RMSECV was numerically higher than RMSEP for the deboned shoulder blade and belly. Conclusion: AutoFom III predicts the weight of deboned shoulder blade, shoulder picnic, loin, belly, and ham with high accuracy, and is a suitable process analytical tool for sorting pork primals in Korea. However, AutoFom III's prediction of smaller commercial Korean cuts is less accurate, which may be attributed to the lack of anatomical reference points and the lack of a good correlation between the scanned area of the carcass and those traits.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.141-149
• /
• 2006

In this paper, we introduce an improved algorithm for computing matrix triple product that commonly arises in primal-dual optimization method. In computing $P=AHA^{t}$, we devise a single pass algorithm that exploits the block diagonal structure of the matrix H. This one-phase scheme requires fewer floating point operations and roughly half the memory of the generic two-phase algorithm, where the product is computed in two steps, computing first $Q=HA^{t}$ and then P=AQ. The one-phase scheme achieved speed-up of 2.04 on Intel Itanium II platform over the two-phase scheme. Based on memory latency and modeled cache miss rates, the performance improvement was evaluated through performance modeling. Our research has impact on performance tuning study of complex sparse matrix operations, while most of the previous work focused on performance tuning of basic operations.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.351-360
• /
• 2005

This paper finds a new class of generalized convex function which satisfies the following properties: It's level set is $\eta$-convex set; Every feasible Kuhn-Tucker point is a global minimum; If Slater's constraint qualification holds, then every minimum point is Kuhn-Tucker point; Weak duality and strong duality hold between primal problem and it's Mond-Weir dual problem.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.433-455
• /
• 2005

Fritz John, and Karush-Kuhn-Tucker type optimality conditions for a constrained variational problem involving higher order derivatives are obtained. As an application of these Karush-Kuhn-Tucker type optimality conditions, Wolfe and Mond-Weir type duals are formulated, and various duality relationships between the primal problem and each of the duals are established under invexity and generalized invexity. It is also shown that our results can be viewed as dynamic generalizations of those of the mathematical programming already reported in the literature.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.2
• /
• pp.37-43
• /
• 1984

For the polymatroidal network, which has set-constraints on arcs, solution procedures to get the weighted maximal flows are investigated. These procedures are composed of the transformation of the polymatroidal network flow problem into a polymatroid intersection problem and a polymatroid intersection algorithm. A greedy polymatroid intersection algorithm is presented, and an example problem is solved. The greedy polymatroid intersection algorithm is a variation of Hassin's. According to these procedures, there is no need to convert the primal problem concerned into dual one. This differs from the procedures of Hassin, in which the dual restricted problem is used.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.87-94
• /
• 2007

We in this note introduce the concept of g-IFP rings which is a generalization of IFP rings. We show that from any IFP ring there can be constructed a right g-IFP ring but not IFP. We also study the basic properties of right g-IFP rings, constructing suitable examples to the situations raised naturally in the process.

• Korean Journal of Mathematics
• /
• v.26 no.3
• /
• pp.467-481
• /
• 2018

In this paper we present a postprocessing scheme for the Raviart-Thomas mixed finite element approximation of the second order elliptic eigenvalue problem. This scheme is carried out by solving a primal source problem on a higher order space, and thereby can improve the convergence rate of the eigenfunction and eigenvalue approximations. It is also used to compute a posteriori error estimates which are asymptotically exact for the $L^2$ errors of the eigenfunctions. Some numerical results are provided to confirm the theoretical results.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.13-21
• /
• 2011

In this paper, a pair of Wolfe type nondifferentiable sec-ond order symmetric minimax mixed integer dual problems is formu-lated. Symmetric and self-duality theorems are established under $\eta_1$-bonvexity/$\eta_2$-boncavity assumptions. Several known results are obtained as special cases. Examples of such primal and dual problems are also given.

• Journal of applied mathematics & informatics
• /
• v.13 no.1_2
• /
• pp.1-10
• /
• 2003

In this paper, we establish a nonlinear Lagrangian algorithm for nonlinear programming problems with inequality constraints. Under some assumptions, it is proved that the sequence of points, generated by solving an unconstrained programming, convergents locally to a Kuhn-Tucker point of the primal nonlinear programming problem.