| File | |
| language |
eng
|
| Attribute |
Research Article
|
| Author |
YAMAMOTO, Shunsuke
Department of Mathematics, Shimane University
|
| Description | 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.
|
| Subject | convex programming
constraint qualification
alternative theorem
|
| Journal Title |
Journal of Nonlinear Analysis and Optimization
|
| Volume | 11
|
| Issue | 2
|
| Start Page | 99
|
| End Page | 109
|
| ISSN | 1906-9685
|
| Published Date | 2020-10-19
|
| Publisher | Center of Excellence in Nonlinear Analysis and Optimization, Naresuan University
|
| NII Type |
Journal Article
|
| Format |
PDF
|
| Relation | |
| Text Version |
著者版
|
| Gyoseki ID | e38845
|
| OAI-PMH Set |
Faculty of Science and Engineering
|
