Characterizations of the basic constraint qualification and its applications

Journal of Nonlinear Analysis and Optimization Volume 11 Issue 2 Page 99-109 published_at 2020-10-19
アクセス数 : 3773
ダウンロード数 : 124

今月のアクセス数 : 31
今月のダウンロード数 : 5
File
Title
Characterizations of the basic constraint qualification and its applications
Creator
YAMAMOTO Shunsuke
Source Title
Journal of Nonlinear Analysis and Optimization
Volume 11
Issue 2
Start Page 99
End Page 109
Journal Identifire
ISSN 1906-9685
Descriptions
In convex programming, the basic constraint qualification is a necessary and sufficient constraint qualification for the optimality condition. In this paper, we give characterizations of the basic constraint qualification at each feasible solution. By using the result, we give an alternative method for checking up the basic constraint qualification at every feasible point without subdifferentials and normal cones.
Subjects
convex programming ( Other)
constraint qualification ( Other)
alternative theorem ( Other)
Language
eng
Resource Type journal article
Publisher
Center of Excellence in Nonlinear Analysis and Optimization, Naresuan University
Date of Issued 2020-10-19
Publish Type Accepted Manuscript
Access Rights open access
Relation
[URI] http://www.math.sci.nu.ac.th/ojs302/index.php/jnao/article/view/555/9998