On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming

number of downloads : ?

Use this link to cite this item : https://ir.lib.shimane-u.ac.jp/32752

File	9.pdf 120 KB
language	eng
Author	Suzuki, Satoshi Kuroiwa, Daishi
Description	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.
Subject	set containment quasiconvex constraints quasiaffine functions constraint qualification
Journal Title	Journal of Optimization Theory and Applications
Volume	149
Issue	3
Start Page	554
End Page	563
ISSN	00223239
Published Date	2011-06
DOI	10.1007/s10957-011-9804-8
DOI Date	2015-07-14
NCID	AA00253056
Publisher	Springer US
NII Type	Journal Article
Format	PDF
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.
Text Version	著者版
OAI-PMH Set	Interdisciplinary Graduate School of Science and Engineering