A Hybrid Smoothing Method for Mixed Nonlinear ComplementarityProblems
Computational Optimization and Applications
Existence and Limiting Behavior of Trajectories Associatedwith P0-equations
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
SSVM: A Smooth Support Vector Machine for Classification
Computational Optimization and Applications
A primal-dual algorithm for minimizing a sum of Euclidean norms
Journal of Computational and Applied Mathematics
Journal of Optimization Theory and Applications
Global projection-type error bounds for general variational inequalities
Journal of Optimization Theory and Applications
Merit Functions for Complementarity and Related Problems: A Survey
Computational Optimization and Applications
Smoothing Newton and Quasi-Newton Methods for Mixed Complementarity Problems
Computational Optimization and Applications
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications
Computational Optimization and Applications
Quadratic one-step smoothing Newton method for P0-LCP without strict complementarity
Applied Mathematics and Computation
A Smoothing Method for a Mathematical Program with P-Matrix Linear Complementarity Constraints
Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization
Focus on computational neurobiology
epsilon-SSVR: A Smooth Support Vector Machine for epsilon-Insensitive Regression
IEEE Transactions on Knowledge and Data Engineering
Some P-Properties for Nonlinear Transformations on Euclidean Jordan Algebras
Mathematics of Operations Research
Expected Residual Minimization Method for Stochastic Linear Complementarity Problems
Mathematics of Operations Research
A smoothing Newton-type method for generalized nonlinear complementarity problem
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Globally convergent Jacobian smoothing inexact Newton methods for NCP
Computational Optimization and Applications
A variant smoothing Newton method for P0-NCP based on a new smoothing function
Journal of Computational and Applied Mathematics
A smoothing inexact Newton method for nonlinear complementarity problems
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
A new smoothing and regularization Newton method for P0-NCP
Journal of Global Optimization
A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
SIAM Journal on Optimization
A new smooth support vector regression based on ε-insensitive logistic loss function
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
ISNN'10 Proceedings of the 7th international conference on Advances in Neural Networks - Volume Part I
A smoothing Broyden-like method for the mixed complementarity problems
Mathematical and Computer Modelling: An International Journal
A quasisecant method for solving a system of nonsmooth equations
Computers & Mathematics with Applications
Element-wise algorithm for modeling ductile fracture with the Rousselier yield function
Computational Mechanics
Hi-index | 0.00 |
It is well known that a nonlinear complementarity problem (NCP) can be formulated as a system of nonsmooth equations. Chen and Mangasarian [Comput. Optim. Appl., 5 (1996), pp. 97--138] proposed a class of parametric smooth functions by twice integrating a probability density function. As a result, the nonsmooth equations can be approximated by smooth equations. This paper refines the smooth functions proposed by Chen and Mangasarian and investigates their structural properties. The refinement allows us to establish the existence, uniqueness, and limiting properties of the trajectory defined by the solutions of these smooth equation approximations. In addition, global error bounds for the NCP with a uniform P-function are obtained.