Treffer: Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
Title:
Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs
Authors:
Source:
Applied mathematics and computation. 162(3):1237-1258
Publisher Information:
New York, NY: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Programmation mathématique numérique, Numerical methods in mathematical programming, Analyse numérique, Numerical analysis, Análisis numérico, Condition Lipschitz, Lipschitz condition, Condicion Lipschitz, Estimation erreur, Error estimation, Estimación error, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Méthode optimisation, Optimization method, Método optimización, Problème complémentarité, Complementarity problem, Problema complementariedad, Programmation mathématique, Mathematical programming, Programación matemática, Programmation non linéaire, Non linear programming, Programación no lineal, Programmation semi définie, Semi definite programming, Programacíon semi definida, Régularité, Regularity, Regularidad, 65Kxx
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, School of Science, Tianjin University, 300072 Tianjin, China
ISSN:
0096-3003
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.16443605
Database:
PASCAL Archive
Weitere Informationen
Error bound theory play an important role in many mathematical programming problems. In this paper, we propose a new assumption condition under which we establish a global Lipshitzian error bound for the semidefinite complementarity problem (SDCP). As corollaries, two results involving the assumptions of strong monotonicity and BD-regularity are given. When the SDCP reduces to the nonlinear complementarity problem (NCP), our results strictly generalize the well-known error bound results which were established under the assumptions of strong monotonicity and uniform P-property. We also establish a new error bound for the NCP under BD-regularity and some R0-type condition.