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: | Donghui Fang, XianFa Luo, Xianyun Wang |
---|---|
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!
|
Similar Items
-
Stable Zero Lagrange Duality for DC Conic Programming
by: D. H. Fang
Published: (2012-01-01) -
On uniformly close-to-convex functions and uniformly quasiconvex
functions
by: K. G. Subramanian, et al.
Published: (2003-01-01) -
Fixed Point of Strong Duality Pseudocontractive Mappings and Applications
by: Baowei Liu
Published: (2012-01-01) -
Bounding Regions to Plane Steepest Descent Curves of Quasiconvex Families
by: Marco Longinetti, et al.
Published: (2016-01-01) -
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order
by: X. F. Hu, et al.
Published: (2013-01-01)