On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming

Journal of Optimization Theory and Applications Volume 149 Issue 3 Page 554-563 published_at 2011-06
アクセス数 : 968
ダウンロード数 : 105

今月のアクセス数 : 13
今月のダウンロード数 : 3
File
9.pdf 120 KB エンバーゴ : 2015-07-12
Title
On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Creator
Source Title
Journal of Optimization Theory and Applications
Volume 149
Issue 3
Start Page 554
End Page 563
Journal Identifire
ISSN 00223239
Descriptions
Dual characterizations of the containment of a convex set with qua-siconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
Subjects
set containment
quasiconvex constraints
quasiaffine functions
constraint qualification
Language
eng
Resource Type journal article
Publisher
Springer US
Date of Issued 2011-06
Rights
© Springer Science+Business Media, LLC 2011
The final publication is available at Springer via http://dx.doi.org/10.1007/s10957-011-9804-8.
Publish Type Accepted Manuscript
Access Rights open access
Relation
[DOI] 10.1007/s10957-011-9804-8
[NCID] AA00253056