Error bounds for symmetric cone complementarity problems

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we investigate the issue of error bounds for symmetric cone complementarity problems (SCCPs). In particular, we show that the distance between an arbitrary point in Euclidean Jordan algebra and the solution set of the symmetric cone complementarity problem can be bounded above by some merit functions such as Fischer-Burmeister merit function, the natural residual function and the implicit Lagrangian function. The so-called R0-type conditions, which are new and weaker than existing ones in the literature, are assumed to guarantee that such merit functions can provide local and global error bounds for SCCPs. Moreover, when SCCPs reduce to linear cases, we demonstrate such merit functions cannot serve as global error bounds under general monotone condition, which implicitly indicates that the proposed R0-type conditions cannot be replaced by P-type conditions which include monotone condition as special cases.

Cite

CITATION STYLE

APA

Miao, X. H., & Chen, J. S. (2013). Error bounds for symmetric cone complementarity problems. Numerical Algebra, Control and Optimization, 3(4), 627–641. https://doi.org/10.3934/naco.2013.3.627

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free