Differentiability v.s. convexity for complementarity functions

Chien Hao Huang, Jein Shan Chen*, Juan Enrique Martinez-Legaz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)


It is known that complementarity functions play an important role in dealing with complementarity problems. The most well known complementarity problem is the symmetric cone complementarity problem (SCCP) which includes nonlinear complementarity problem (NCP), semidefinite complementarity problem (SDCP), and second-order cone complementarity problem (SOCCP) as special cases. Moreover, there is also so-called generalized complementarity problem (GCP) in infinite dimensional space. Among the existing NCP-functions, it was observed that there are no differentiable and convex NCP-functions. In particular, Miri and Effati (J Optim Theory Appl 164:723–730, 2015) show that convexity and differentiability cannot hold simultaneously for an NCP-function. In this paper, we further establish that such result also holds for general complementarity functions associated with the GCP.

Original languageEnglish
Pages (from-to)209-216
Number of pages8
JournalOptimization Letters
Issue number1
Publication statusPublished - 2017 Jan 1


  • Closed convex cone
  • Complementarity functions
  • NCP-functions
  • Second-order cone

ASJC Scopus subject areas

  • Control and Optimization


Dive into the research topics of 'Differentiability v.s. convexity for complementarity functions'. Together they form a unique fingerprint.

Cite this