• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.757-777
• /
• 2019

In this paper, we study the convergence analysis of the sequences generated by the proximal point method for an infinite family of pseudo-monotone equilibrium problems in Banach spaces. We first prove the weak convergence of the generated sequence to a common solution of the infinite family of equilibrium problems with summable errors. Then, we show the strong convergence of the generated sequence to a common equilibrium point by some various additional assumptions. We also consider two variants for which we establish the strong convergence without any additional assumption. For both of them, each iteration consists of a proximal step followed by a computationally inexpensive step which ensures the strong convergence of the generated sequence. Also, for this two variants we are able to characterize the strong limit of the sequence: for the first variant it is the solution lying closest to an arbitrarily selected point, and for the second one it is the solution of the problem which lies closest to the initial iterate. Finally, we give a concrete example where the main results can be applied.

• Journal of KIISE:Software and Applications
• /
• v.30 no.12
• /
• pp.1239-1246
• /
• 2003

Registration is the process aligning the range data sets from different views in a common coordinate system. In order to achieve a complete 3D model, we need to refine the data sets after coarse registration. One of the most popular refinery techniques is the iterative closest point (ICP) algorithm, which starts with pre-estimated overlapping regions. This paper presents an improved ICP algorithm that can automatically register multiple 3D data sets from unknown viewpoints. The sensor projection that represents the mapping of the 3D data into its associated range image is used to determine the overlapping region of two range data sets. By combining ICP algorithm with the sensor projection constraint, we can make an automatic registration of multiple 3D sets without pre-procedures that are prone to errors and any mechanical positioning device or manual assistance. The experimental results showed better performance of the proposed method on a couple of 3D data sets than previous methods.

• Journal of the Korean Geotechnical Society
• /
• v.22 no.9
• /
• pp.45-59
• /
• 2006

The successful performance of any numerical geotechnical simulation depends on the accuracy and efficiency of the numerical implementation of constitutive model used to simulate the stress-strain (constitutive) response of the soil. The corner stone of the numerical implementation of constitutive models is the numerical integration of the incremental form of soil-plasticity constitutive equations over a discrete sequence of time steps. In this paper a well known two-surface soil plasticity model is implemented using a generalized implicit return mapping algorithm to arbitrary convex yield surfaces referred to as the Closest-Point-Projection method (CPPM). The two-surface model describes the nonlinear behavior of coarse-grained materials by incorporating a bounding surface concept together with isotropic and kinematic hardening as well as fabric formulation to account for the effect of fabric formation on the unloading response. In the course of investigating the performance of the CPPM integration method, it is proven that the algorithm is an accurate, robust, and efficient integration technique useful in finite element contexts. It is also shown that the algorithm produces a consistent tangent operator $\frac{d\sigma}{d\varepsilon}$ during the iterative process with quadratic convergence rate of the global iteration process.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.6 s.237
• /
• pp.860-875
• /
• 2005

A new meshfree method for the analysis of elasto-plastic deformations is presented. The method is based on the proposed first-order least-squares formulation, to which the moving least-squares approximation is applied. The least-squares formulation for the classical elasto-plasticity and its extension to an incrementally objective formulation for finite deformations are proposed. In the formulation, the equilibrium equation and flow rule are enforced in least-squares sense, while the hardening law and loading/unloading condition are enforced exactly at each integration point. The closest point projection method for the integration of rate-form constitutive equation is inherently involved in the formulation, and thus the radial-return mapping algorithm is not performed explicitly. Also the penalty schemes for the enforcement of the boundary and frictional contact conditions are devised. The main benefit of the proposed method is that any structure of cells is not used during the whole process of analysis. Through some numerical examples of metal forming processes, the validity and effectiveness of the method are presented.