• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.335-341
• /
• 2009

In this paper, a system of nonsmooth equations reformulated from a nonlinear complementarity problem with nonsmooth data is studied. The formulas of some subdifferentials for related functions in this system of nonsmooth equations are developed. The present work can be applied to Newton methods for solving this kind of nonlinear complementarity problem.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.333-342
• /
• 2007

A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for constructing search directions. The convergence analysis is given as well.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.189-197
• /
• 2013

In this paper, Karush-Kuhn-Tucker type sufficient optimality conditions are obtained for a feasible point of a nonsmooth multiobjective fractional programming problem to be an efficient or properly efficient by using generalized ($F,{\rho},{\sigma}$)-type I functions.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1527-1534
• /
• 2010

In this paper, we consider nonsmooth optimization problem of which objective and constraint functions are locally Lipschitz. We establish sufficient optimality conditions and duality results for nonsmooth vector optimization problem given under nearly strict invexity and near invexity-infineness assumptions.

• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.609-619
• /
• 2014

Nonsmooth equations with finitely many maximum functions is often used in the study of complementarity problems, variational inequalities and many problems in engineering and mechanics. In this paper, we consider the global convergence methods for nonsmooth equations with finitely many maximum functions. The steepest decent method and the smoothing gradient method are used to solve the nonsmooth equations with finitely many maximum functions. In addition, the convergence analysis and the applications are also given. The numerical results for the smoothing gradient method indicate that the method works quite well in practice.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.6
• /
• pp.1791-1809
• /
• 2018

Let T be the singular integral operator with nonsmooth kernel which was introduced by Duong and McIntosh, and $T_q(q{\in}(1,{\infty}))$ be the vector-valued operator defined by $T_qf(x)=({\sum}_{k=1}^{\infty}{\mid}T\;f_k(x){\mid}^q)^{1/q}$. In this paper, by proving certain weak type endpoint estimate of L log L type for the grand maximal operator of T, the author establishes some quantitative weighted bounds for $T_q$ and the corresponding vector-valued maximal singular integral operator.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.1
• /
• pp.31-40
• /
• 2017

In this paper, we consider a nonsmooth multiobjective robust optimization problem with more than two locally Lipschitz objective functions and locally Lipschitz constraint functions in the face of data uncertainty. We prove a nonsmooth sufficient optimality theorem for a weakly robust efficient solution of the problem. We formulate a Wolfe type dual problem for the problem, and establish duality theorems which hold between the problem and its Wolfe type dual problem.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.135-146
• /
• 1997

For the numerical simulation of wave phenomena either in unbounded domains that it is not feasible to compute solutions on the entire region, it is needed to truncate the original domains to manageable bounded domains whose geometries are simple but usually nonsmooth. On the artificial boundaries thus created, absorbing boundary conditions are taken so that the significant part of waves arriving at the artificial boundaries can be transmitted [5,10,11,16,17,26]$.

• Journal of the Chungcheong Mathematical Society
• /
• v.37 no.1
• /
• pp.41-55
• /
• 2024

The nonconvex and nonsmooth optimization problem has been widely applicable in image processing and machine learning. In this paper, we propose an extension of the proximal iteratively reweighted ℓ₁ algorithm for nonconvex and nonsmooth minmization problem. We assume the co-coerciveness of a term of objective function instead of Lipschitz gradient condition, which is generalized property of Lipschitz continuity. We prove the global convergence of the proposed algorithm. Numerical results show that the proposed algorithm converges faster than original proximal iteratively reweighed algorithm and existing algorithms.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.3
• /
• pp.595-604
• /
• 2012

In this article, we consider chaotic behavior happened in nonsmooth dynamical systems. To quantify such a behavior, a computation of Lyapunov exponents for chaotic orbits of a given nonsmooth dynamical system is focused. The Lyapunov exponent is a very important concept in chaotic theory, because this quantity measures the sensitive dependence on initial conditions in dynamical systems. Therefore, Lyapunov exponents can decide whether an orbit is chaos or not. To measure the sensitive dependence on initial conditions for nonsmooth dynamical systems, the calculation of Lyapunov exponent plays a key role, but in a theoretical point of view or based on the definition of Lyapunov exponents, Lyapunov exponents of nonsmooth orbit could not be calculated easily, because the Jacobian derivative at some point in the orbit may not exists. We use an algorithmic calculation method for computing Lyapunov exponents using time series for a two dimensional piecewise smooth dynamic system.