In this paper, we study the directional derivative, subderivative, and subdifferential of sup-type functions without any compactness assumption on the index set. As applications, we provide an estimate of the Lipschitz modulus for sup-type functions.
In this paper, we propose a smoothing algorithm for solving the monotone symmetric cone complementarity problems (SCCP for short) with a nonmonotone line search. We show that the nonmonotone algorithm is globally convergent under an assumption that the solution set of the problem concerned is nonempty. Such an assumption is weaker than those given in most existing algorithms for solving optimization problems over symmetric cones. We also prove that the solution obtained by the algorithm is a maximally complementary solution to the monotone SCCP under some assumptions.