On Several Types of Basic Constraint Qualifications via Coderivatives for Generalized Equations

In this paper, we study several types of basic constraint qualifications in terms of Clarke/Fréchet coderivatives for generalized equations. Several necessary and/or sufficient conditions are given to ensure these constraint qualifications. It is proved that basic constraint qualification and strong...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications Vol. 177; no. 1; pp. 106 - 126
Main Authors: Wei, Zhou, Yao, Jen-Chih
Format: Journal Article
Language:English
Published: New York Springer US 01.04.2018
Springer Nature B.V
Subjects:
Applications of Mathematics
Calculus of Variations and Optimal Control; Optimization
Engineering
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Qualifications
Theory of Computation
90C31
Normal cone
90C25
49J52
Coderivative
Generalized equation
46B20
End set
Basic constraint qualification
ISSN:0022-3239, 1573-2878
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study several types of basic constraint qualifications in terms of Clarke/Fréchet coderivatives for generalized equations. Several necessary and/or sufficient conditions are given to ensure these constraint qualifications. It is proved that basic constraint qualification and strong basic constraint qualification for convex generalized equations can be obtained by these constraint qualifications, and the existing results on constraint qualifications for the inequality system can be deduced from the given conditions in this paper. The main work of this paper is an extension of the study on constraint qualifications from inequality systems to generalized equations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-018-1231-7