ファイル情報(添付) |
![]() |
タイトル |
Optimality Conditions and Constraint Qualifications for Quasiconvex Programming
|
著者 | |
収録物名 |
Journal of Optimization Theory and Applications
|
巻 | 183 |
号 | 3 |
開始ページ | 963 |
終了ページ | 976 |
収録物識別子 |
ISSN 0022-3239
EISSN 1573-2878
|
内容記述 |
その他
In mathematical programming, various kinds of optimality conditions have been introduced. In the research of optimality conditions, some types of subdifferentials play an important role. Recently, by using Greenberg–Pierskalla subdifferential and Martínez-Legaz subdifferential, necessary and sufficient optimality conditions for quasiconvex programming have been introduced. On the other hand, constraint qualifications are essential elements for duality theory in mathematical programming. Over the last decade, necessary and sufficient constraint qualifications for duality theorems have been investigated extensively. Recently, by using the notion of generator, necessary and sufficient constraint qualifications for Lagrange-type duality theorems have been investigated. However, constraint qualifications for optimality conditions in terms of Greenberg–Pierskalla subdifferential and Martínez-Legaz subdifferential have not been investigated yet. In this paper, we study optimality conditions and constraint qualifications for quasiconvex programming. We introduce necessary and sufficient optimality conditions in terms of Greenberg–Pierskalla subdifferential, Martínez-Legaz subdifferential and generators. We investigate necessary and/or sufficient constraint qualifications for these optimality conditions. Additionally, we show some equivalence relations between duality results for convex and quasiconvex programming.
|
主題 |
Quasiconvex programming
Optimality condition
Constraint qualification
Generator of a quasiconvex function
|
言語 |
英語
|
資源タイプ | 学術雑誌論文 |
出版者 |
Springer
|
発行日 | 2019-12 |
出版タイプ | Accepted Manuscript(出版雑誌の一論文として受付されたもの。内容とレイアウトは出版社の投稿様式に沿ったもの) |
アクセス権 | オープンアクセス |
関連情報 |
[DOI] 10.1007/s10957-019-01534-7
|