抄録
Recently, many researchers studied set containment characterizations. In this paper, we introduce some set containment characterizations for quasiconvex programming. Furthermore, we show a duality theorem for quasiconvex programming by using set containment characterizations. Notions of quasiconjugate for quasiconvex functions, especially 1, -1-quasiconjugate, 1-semiconjugate, H-quasiconjugate and R-quasiconjugate, play important roles to derive characterizations of the set containments.
収録刊行物
-
- Proceedings : Fifth International Workshop on Computational Intelligence & Applications
-
Proceedings : Fifth International Workshop on Computational Intelligence & Applications 2009 (1), 264-266, 2009-11-11
IEEE SMC Hiroshima Chapter
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050011097165772928
-
- NII論文ID
- 120006658681
-
- ISSN
- 18833977
-
- 本文言語コード
- en
-
- 資料種別
- conference paper
-
- データソース種別
-
- IRDB
- CiNii Articles