• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.571-584
• /
• 1998

We look for methods and conditions to make use of cyclicity in come matrix problems not only for parallel computa-tion but also to reduce the problem size and accelerate convergence. It has been shown that some form of reducibility not necessarily cyclicity is enough for such purposes.

• Journal of KSNVE
• /
• v.7 no.4
• /
• pp.571-578
• /
• 1997

Recently, many general-purpose packages for fluid-structure interaction problems have been announced. However, they have a lot of limitations to model structures in the fluid-structure interaction problems reasonably. Utilizing general-purpose packages such as MSC/NASTRAN and SYSNOISE, in this paper, a method to slove the radiation scattering problems with some accuracy in the fluid-structure interaction problems was developed. Using a simple model, the results from the presented method here are compared with those from SYSNOISE. The result shows quite a good agreement between the two methods. The problems, which could not be solved by SYSNOISE, were tried to solve with the presented method and results were presented. It was proved that this method could be safely used to solve fluid-structure interaction problems.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.869-879
• /
• 2022

In this paper, we consider matrix optimization problems. We investigate augmented Lagrangian methods of multipliers and alternating direction methods of multipliers for the problems. Following the proofs of Eckstein [3], and Eckstein and Yao [5], we prove convergence theorems for augmented Lagrangian methods of multipliers and alternating direction methods of multipliers for the problems.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.271-281
• /
• 2003

In this paper, a new nonlinear programming approach is suggested to solve biaffine matrix inequality (BMI) problems in multiobjective and structured controls. It is shown that these BMI problems are reduced to nonlinear minimization problems. An algorithm that is easily implemented with existing convex optimization codes is presented for the nonlinear minimization problem. The efficiency of the proposed algorithm is illustrated by numerical examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.224-224
• /
• 2000

Biaffine Matrix Inequalities(BIs) are known to give more general and flexible frameworks in control designs than Linear Matrix Inequalities(LMIs). However, BMIs are nonconvex constraints and very difficult to solve. In this paper, BMI problems are solved using Evolution Strategy(ES). Numerous BMI problems are solved to verify performances of ES solver for BMI problems and compared with those of Genetic Algorithms and Branch-and-Cut algorithm.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.795-812
• /
• 2013

The merit function arises from the development of the solution methods for the complementarity problems defined over the cone of non negative real vectors and has been well extended to the complementarity problems defined over the symmetric cones. In this paper, we focus on the extension of the merit functions including the gap function, the regularized gap function, the implicit Lagrangian and others to the complementarity problems defined over the nonsymmetric matrix cone. These theoretical results of this paper suggest new solution methods based on unconstrained and/or simply constrained methods to solve the matrix cone complementarity problems (MCCP).

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.1045-1058
• /
• 2000

In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1361-1378
• /
• 2008

This paper deals with the study of dichotomy and conditioning for two-point boundary value problems associated with first order matrix Lyapunov systems, with the help of Kronecker product of matrices. Further, we obtain close relationship between the stability bounds of the problem on one hand, and the growth behaviour of the fundamental matrix solution on the other hand.

• Journal of Information Technology Applications and Management
• /
• v.16 no.1
• /
• pp.97-113
• /
• 2009

Collaborative filtering(CF) has been a very successful approach for building recommender system, but its widespread use has exposed to some well-known problems including sparsity and scalability problems. In order to mitigate these problems, we propose two novel models for improving the typical CF algorithm, whose names are ISCF(Item-Selected CF) and USCF(User-Selected CF). The modified models of the conventional CF method that condense the original dataset by reducing a dimension of items or users in the user-item matrix may improve the prediction accuracy as well as the efficiency of the conventional CF algorithm. As a tool to optimize the reduction of a user-item matrix, our study proposes genetic algorithms. We believe that our approach may relieve the sparsity and scalability problems. To validate the applicability of ISCF and USCF, we applied them to the MovieLens dataset. Experimental results showed that both the efficiency and the accuracy were enhanced in our proposed models.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.25-36
• /
• 2003

We study the question of whether a partial (0, 1)-normal matrix has a non-symmetric normal completion. Matrix sandwich problems are an important and special case of matrix completion problems. In this paper, we give some properties for the (0, 1)-normal matrices and some large classes that satisfies the normal sandwich completion.