Strong and Total Lagrange Dualities for Quasiconvex Programming
We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualificatio...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/453912 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558279479263232 |
|---|---|
| author | Donghui Fang XianFa Luo Xianyun Wang |
| author_facet | Donghui Fang XianFa Luo Xianyun Wang |
| author_sort | Donghui Fang |
| collection | DOAJ |
| description | We consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities. |
| format | Article |
| id | doaj-art-d87cd7c429644cbd89e9c84924dac26d |
| institution | Kabale University |
| issn | 1110-757X 1687-0042 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj-art-d87cd7c429644cbd89e9c84924dac26d2025-02-03T01:32:55ZengWileyJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/453912453912Strong and Total Lagrange Dualities for Quasiconvex ProgrammingDonghui Fang0XianFa Luo1Xianyun Wang2College of Mathematics and Statistics, Jishou University, Jishou 416000, ChinaDepartment of Mathematics, China Jiliang University, Hangzhou 310018, ChinaCollege of Mathematics and Statistics, Jishou University, Jishou 416000, ChinaWe consider the strong and total Lagrange dualities for infinite quasiconvex optimization problems. By using the epigraphs of the z-quasi-conjugates and the Greenberg-Pierskalla subdifferential of these functions, we introduce some new constraint qualifications. Under the new constraint qualifications, we provide some necessary and sufficient conditions for infinite quasiconvex optimization problems to have the strong and total Lagrange dualities.http://dx.doi.org/10.1155/2014/453912 |
| spellingShingle | Donghui Fang XianFa Luo Xianyun Wang Strong and Total Lagrange Dualities for Quasiconvex Programming Journal of Applied Mathematics |
| title | Strong and Total Lagrange Dualities for Quasiconvex Programming |
| title_full | Strong and Total Lagrange Dualities for Quasiconvex Programming |
| title_fullStr | Strong and Total Lagrange Dualities for Quasiconvex Programming |
| title_full_unstemmed | Strong and Total Lagrange Dualities for Quasiconvex Programming |
| title_short | Strong and Total Lagrange Dualities for Quasiconvex Programming |
| title_sort | strong and total lagrange dualities for quasiconvex programming |
| url | http://dx.doi.org/10.1155/2014/453912 |
| work_keys_str_mv | AT donghuifang strongandtotallagrangedualitiesforquasiconvexprogramming AT xianfaluo strongandtotallagrangedualitiesforquasiconvexprogramming AT xianyunwang strongandtotallagrangedualitiesforquasiconvexprogramming |