A Comparison of Large Scale Mixed Complementarity Problem Solvers
Computational Optimization and Applications
A Hybrid Smoothing Method for Mixed Nonlinear ComplementarityProblems
Computational Optimization and Applications
Computational Optimization and Applications
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems
Computational Optimization and Applications
Some Optimization Reformulations of the Extended Linear Complementarity Problem
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Computational Optimization and Applications
Computational Optimization and Applications
Hybrid Newton-type method for a class of semismooth equations
Journal of Optimization Theory and Applications
Global Optimization Techniques for Mixed Complementarity Problems
Journal of Global Optimization
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems
Computational Optimization and Applications
Merit Functions for Complementarity and Related Problems: A Survey
Computational Optimization and Applications
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications
On Two Applications of H-Differentiability to Optimization and Complementarity Problems
Computational Optimization and Applications
Global Newton-type methods and semismooth reformulations for NCP
Applied Numerical Mathematics
An interior-point affine-scaling trust-region method for semismooth equations with box constraints
Computational Optimization and Applications
A smoothing Newton-type method for generalized nonlinear complementarity problem
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
A descent method for a reformulation of the second-order cone complementarity problem
Journal of Computational and Applied Mathematics
Box-constrained minimization reformulations of complementarity problems in second-order cones
Journal of Global Optimization
A family of NCP functions and a descent method for the nonlinear complementarity problem
Computational Optimization and Applications
Optimization Methods & Software
Journal of Computational and Applied Mathematics
Globally convergent Jacobian smoothing inexact Newton methods for NCP
Computational Optimization and Applications
A smoothing conic trust region filter method for the nonlinear complementarity problem
Journal of Computational and Applied Mathematics
Journal of Computational and Applied Mathematics
Information Sciences: an International Journal
A smoothing inexact Newton method for nonlinear complementarity problems
Journal of Computational and Applied Mathematics
Smoothing algorithms for complementarity problems over symmetric cones
Computational Optimization and Applications
A new smoothing Newton-type algorithm for semi-infinite programming
Journal of Global Optimization
Smoothing Newton method for NCP with the identification of degenerate indices
Journal of Computational and Applied Mathematics
Exact penalties for variational inequalities with applications to nonlinear complementarity problems
Computational Optimization and Applications
A non-interior continuation algorithm for the CP based on a generalized smoothing function
Journal of Computational and Applied Mathematics
A new hybrid method for nonlinear complementarity problems
Computational Optimization and Applications
A new class of penalized NCP-functions and its properties
Computational Optimization and Applications
Computational Optimization and Applications
A cell-based dynamic traffic assignment model: Formulation and properties
Mathematical and Computer Modelling: An International Journal
A neural network for the linear complementarity problem
Mathematical and Computer Modelling: An International Journal
The SC1 property of an expected residual function arising from stochastic complementarity problems
Operations Research Letters
Stochastic mathematical programs with equilibrium constraints
Operations Research Letters
A globalized Newton method for the computation of normalized Nash equilibria
Journal of Global Optimization
Hi-index | 0.01 |
We investigate the properties of a new merit function which allows us to reduce a nonlinear complementarity problem to an unconstrained global minimization one. Assuming that the complementarity problem is defined by a $P_0$-function, we prove that every stationary point of the unconstrained problem is a global solution; furthermore, if the complementarity problem is defined by a uniform $P$-function, the level sets of the merit function are bounded. The properties of the new merit function are compared with those of Mangasarian--Solodov's implicit Lagrangian and Fukushima's regularized gap function. We also introduce a new simple active-set local method for the solution of complementarity problems and show how this local algorithm can be made globally convergent by using the new merit function.