• 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.

• Kyungpook Mathematical Journal
• /
• v.46 no.1
• /
• pp.145-152
• /
• 2006

In this paper, we study a class of strongly nonlinear implicit complementarity problems in the setting of Hilbert spaces H (not necessarily Hilbert lattices). By using the property of the projection and a suitable change of variables, we establish the equivalence between the strongly nonlinear implicit complementarity problem and the fixed point problem in H. Moreover, we use this equivalence and the fixed point theorem of Boyd and Wong to prove the existence and uniqueness of solutions for the strongly nonlinear implicit complementarity problem in H.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.491-505
• /
• 1997

This paper deals with the formulation and solution of a wide class of structures, in the presence of both geometric and material nonlinearities, as a particular mathematical programming problem. We first present key ideas for the nonholonomic (path dependent) rate formulation for a suitably discretized structural model before we develop its computationally advantageous stepwise holonomic (path independent) counterpart. A feature of the final mathematical programming problem, known as a nonlinear complementarity problem, is that the governing relations exhibit symmetry as a result of the introduction of so-called nonlinear "residuals". One advantage of this form is that it facilitates application of a particular iterative algorithm, in essence a predictor-corrector method, for the solution process. As an illustrative example, we specifically consider the simplest case of plane trusses and detail in particular the general methodology for establishing the static-kinematic relations in a dual format. Extension to other skeletal structures is conceptually transparent. Some numerical examples are presented to illustrate applicability of the procedure.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.357-372
• /
• 1998

In this paper we introduce and study a new class of random completely generalized strongly nonlinear quasi -comple- mentarity problems with non-compact valued random fuzzy map-pings and construct some new iterative algorithms for this kind of random fuzzy quasi-complementarity problems. We also prove the existence of random solutions for this class of random fuzzy quasi-complementarity problems and the convergence of random iterative sequences generated by the algorithms.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.1-12
• /
• 1997

Complementaity problem theory developed by Lemke [10], Cottle and Dantzig [8] and others in the early 1960s and thereafter, has numerous applications in diverse fields of mathematical and engineering sciences. And it is closely related to variational inquality theory and fixed point theory. Recently, fixed point methods for the solving of nonlinear complementarity problems were considered by Noor et al. [11, 12]. Also complementarity problems related to variational inequality problems were investigated by Chang [1], Cottle [7] and others.

• East Asian mathematical journal
• /
• v.4
• /
• pp.25-31
• /
• 1988

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.

• Structural Engineering and Mechanics
• /
• v.6 no.8
• /
• pp.857-870
• /
• 1998

This paper deals with a special class of inverse problems in discrete structural plasticity involving the identification of elastic limits and hardening moduli on the basis of information on displacements. The governing equations lead naturally to a special and challenging optimization problem known as a Mathematical Program with Equilibrium Constraints (MPEC), a key feature of which is the orthogonality of two sign-constrained vectors or so-called "complementarity" condition. We investigate numerically the application of two simple algorithms, both based on the use of the general purpose nonlinear programming code CONOPT accessed via the GAMS modeling language, for solving the suitably reformulated problem. Application is illustrated by means of two numerical examples.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.211-225
• /
• 2014

A new class of smoothing functions is introduced in this paper, which includes some important smoothing complementarity functions as its special cases. Based on this new smoothing function, we proposed a smoothing Newton method. Our algorithm needs only to solve one linear system of equations. Without requiring the nonemptyness and boundedness of the solution set, the proposed algorithm is proved to be globally convergent. Numerical results indicate that the smoothing Newton method based on the new proposed class of smoothing functions with ${\theta}{\in}(0,1)$ seems to have better numerical performance than those based on some other important smoothing functions, which also demonstrate that our algorithm is promising.