New NCP-functions and their properties
Journal of Optimization Theory and Applications
Merit functions for semi-definite complementarity problems
Mathematical Programming: Series A and B
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems
Computational Optimization and Applications
Smoothing Functions for Second-Order-Cone Complementarity Problems
SIAM Journal on Optimization
An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
Mathematical Programming: Series A and B
Cartesian P-property and Its Applications to the Semidefinite Linear Complementarity Problem
Mathematical Programming: Series A and B
SIAM Journal on Optimization
Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
Mathematics of Operations Research
A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
SIAM Journal on Optimization
Smoothing algorithms for complementarity problems over symmetric cones
Computational Optimization and Applications
Hi-index | 0.00 |
For the symmetric cone complementarity problem, we show that each stationary point of the unconstrained minimization reformulation based on the Fischer-Burmeister merit function is a solution to the problem, provided that the gradient operators of the mappings involved in the problem satisfy column monotonicity or have the Cartesian P"0-property. These results answer the open question proposed in the article that appeared in Journal of Mathematical Analysis and Applications 355 (2009) 195-215.