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

In this paper, we present a strongly convergent parallel projection algorithm by introducing some parameter sequences for convex feasibility problem. To prove the strong convergence in a simple way, we transmit the parallel algorithm in the original space to an alternating one in a newly constructed product space. Thus, the strong convergence of the parallel projection algorithm is derived with the help of the alternating one under some parametric controlling conditions.

• Journal of the Korean Mathematical Society
• /
• v.38 no.6
• /
• pp.1275-1284
• /
• 2001

In this paper, we introduce an iteration generated by countable nonexpansive mappings and prove a weak convergence theorem which is connected with the feasibility problem. This result is used to solve the problem of finding a solution of the countable convex inequality system and the problem of finding a common fixed point for a commuting countable family of nonexpansive mappings.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1347-1359
• /
• 2017

The purpose of this paper is to give some new iterative methods for finding a common zero of a finite family of monotone operators in Hilbert spaces. We also give the applications of the obtained result for the convex feasibility problem and constrained convex optimization problem in Hilbert spaces.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.451-474
• /
• 2021

In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.523-527
• /
• 2004

This paper presents a new design methods of the short-term load forecasting system (STLFS) using the data mining. The proposed predictor takes form of the convex combination of the linear time series predictors for each inputs. The problem of estimating the consequent parameters is formulated by the convex optimization problem, which is to minimize the norm distance between the real load and the output of the linear time series estimator, The problem of estimating the premise parameters is to find the parameter value minimizing the error between the real load and the overall output. Finally, to show the feasibility of the proposed method, this paper provides the short-term load forecasting example.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2005.04a
• /
• pp.79-82
• /
• 2005

In this study, we have tested the feasibility of the convex non-linear objective model and the line search optimization method for the fluence map optimization (FMO). We've created the convex nonlinear objective function with simple bound constraints and attained the optimal solution using well-known gradient algorithms with an Armijo line search that requires sufficient objective function decrease. The algorithms were applied to 10 head-and-neck cases. The numbers of beamlets were between 900 and 2,100 with a 3 mm isotropic dose grid. Nonlinear optimization methods could efficiently solve the IMRT FMO problem in well under a minute with high quality for clinical cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.64.5-64
• /
• 2002

This paper concerns a new digital redesign (DR) technique for an observer-based output-feedback control (OBOFC) system. The term DR involves converting an analog controller into an equivalent digital one in the sense of state-matching. The considered DR problem is formulated as convex minimization problems of the norm distances between linear operators to be matched. The stability condition is easily embedded and the separation principle on the DR of the OBOFC is explicitly shown. A numerical example is included for visualizing the feasibility of the proposed technique.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.893-895
• /
• 2005

We represent an efficient intelligent digital redesign method for a Takagi-Sugeno (T-S) fuzzy system. intelligent digital redesign means that an existing analog fuzzy-model-based controller converts to equivalent digital counter part in the sense of state-matching. The proposed method performs previous work, moreover, it allows to matching the states of the overall closed-loop T-S fuzzy system with the predesigned analog fuzzy-model-based controller. And the problem of stability represent convex optimization problem and cast into linear matrix inequality (LMI) framework. This method applies to the helicopter systems which are the nonlinear plant and determine the feasibility and effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.3105-3107
• /
• 2005

We represent an efficient intelligent digital redesign method for a Takagi-Sugeno (T-S) fuzzy system. Intelligent digital redesign means that an existing analog fuzzy-model-based controller converts to equivalent digital counter part in the sense of state-matching. The proposed method performs previous work, moreover, it allows to matching the states of the overall closed-loop T-S fuzzy system with the predesigned analog fuzzy-model-based controller. And the problem of stability represent convex optimization problem and cast into linear matrix inequality (LMI) framework. This method applies to the helicopter systems which are the nonlinear plant and determine the feasibility and effectiveness of the proposed method.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.565-576
• /
• 1997

The material-based homogenization design method generates arbitrary topologies of initial structural design as well as reinforcement structural design by controlling the amount of material available. However, if a small volume constraint is specified in the design of Lightweight structures, thin and slender structures are usually obtained. For these structures stability becomes one of the most important requirements. Thus, to prevent overall buckling (that is, to increase stability), the objective of the design is to maximize the buckling load of a structure. In this paper, the buckling analysis is restricted to the linear buckling behavior of a structure. The global stability requirement is defined as a stiffness constraint, and determined by solving the eigenvalue problem. The optimality conditions to update the design variables are derived based on the sequential convex approximation method and the dual method. Illustrated examples are presented to validate the feasibility of this method in the design of structures.