On the resolution of monotone complementarity problems
Computational Optimization and Applications
Computational Optimization and Applications
On the Resolution of the Generalized Nonlinear Complementarity Problem
SIAM Journal on Optimization
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
SIAM Journal on Optimization
SIAM Journal on Optimization
Equilibrium problems involving the Lorentz cone
Journal of Global Optimization
Hi-index | 0.00 |
Reformulations of a generalization of a second-order cone complementarity problem (GSOCCP) as optimization problems are introduced, which preserve differentiability. Equivalence results are proved in the sense that the global minimizers of the reformulations with zero objective value are solutions to the GSOCCP and vice versa. Since the optimization problems involved include only simple constraints, a whole range of minimization algorithms may be used to solve the equivalent problems. Taking into account that optimization algorithms usually seek stationary points, a theoretical result is established that ensures equivalence between stationary points of the reformulation and solutions to the GSOCCP. Numerical experiments are presented that illustrate the advantages and disadvantages of the reformulations.