| File | |
| Title |
Observations of closed cone constraint qualification for quasiconvex programming
|
| Creator | |
| Source Title |
The Sixth International Conference on Nonlinear Analysis and Convex Analysis proceedings
|
| Start Page | 321 |
| End Page | 326 |
| Descriptions |
Other
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.
|
| Language |
eng
|
| Resource Type | conference paper |
| Date of Issued | 2010 |
| Publish Type | Accepted Manuscript |
| Access Rights | restricted access |
| Relation |
[NCID]
BB04224055
|
