ダウンロード数 : ?
File
Thumnail 13.pdf 76.4 KB ( 限定公開 )
language
eng
Author
Description
In convex programming, constraint qualifications are very important. For example, the closed cone constraint qualification (CCCQ) is the weakest condition for Lagrange duality problem. Also, the CCCQ is a necessary and sufficient condition for a certain duality problem in quasiconvex programming. So, in this paper, we give the definition of the CCCQ for quasiconvex programming and give a sufficient condition of the CCCQ.
Journal Title
The Sixth International Conference on Nonlinear Analysis and Convex Analysis proceedings
Start Page
321
End Page
326
Published Date
2010
NCID
BB04224055
NII Type
Conference Paper
Format
PDF
Text Version
著者版
Gyoseki ID
e23593
OAI-PMH Set
Department of Mathematics, Interdisciplinary Graduate School of Science and Engineering
このエントリーをはてなブックマークに追加