Optimization Online


A new class of merit functions for the semidefinite complementarity problem

Rosely M. B. Goes (rose***at***mat.ufg.br)
Paulo R. Oliveira (poliveir***at***cos.ufrj.br)

Abstract: Recently,Tseng extended a class of merit functions for the nonlinear complementarity problem to semidefinite complementarity problem (SDCP), showing some properties under suitable assumptions. Yamashita and Fukushima also presented other properties. In this paper, we propose a new class of merit functions for the SDCP, and prove some of those properties, under weaker hypothesis. Particularly, we obtained conditions under which those merit functions provide a global error bound for SDCP, and conditions that guarantee bounded level sets.

Keywords: Semidefinite complementarity problem, merit functions, error bound

Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Category 2: Complementarity and Variational Inequalities

Citation: ES-569, Programa de Engenharia de sistemas e Computação/COPPE/Federal University of Rio de Janeiro, January/2002

Download: [Postscript]

Entry Submitted: 02/05/2002
Entry Accepted: 02/05/2002
Entry Last Modified: 02/06/2002

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society