Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 453912, 8 pages
http://dx.doi.org/10.1155/2014/453912
Research Article

Strong and Total Lagrange Dualities for Quasiconvex Programming

1College of Mathematics and Statistics, Jishou University, Jishou 416000, China
2Department of Mathematics, China Jiliang University, Hangzhou 310018, China

Received 17 January 2014; Accepted 1 May 2014; Published 22 May 2014

Academic Editor: Ching-Jong Liao

Copyright © 2014 Donghui Fang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. I. Boţ and G. Wanka, “Farkas-type results with conjugate functions,” SIAM Journal on Optimization, vol. 15, no. 2, pp. 540–554, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  2. R. I. Boţ, S. M. Grad, and G. Wanka, “On strong and total Lagrange duality for convex optimization problems,” Journal of Mathematical Analysis and Applications, vol. 337, no. 2, pp. 1315–1325, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. N. Dinh, M. A. Goberna, and M. A. López, “From linear to convex systems: consistency, Farkas' lemma and applications,” Journal of Convex Analysis, vol. 13, no. 1, pp. 279–290, 2006. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. N. Dinh, M. A. Goberna, M. A. López, and T. Q. Son, “New Farkas-type constraint qualifications in convex infinite programming,” ESAIM Control, Optimisation and Calculus of Variations, vol. 13, no. 3, pp. 580–597, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. D. H. Fang, C. Li, and K. F. Ng, “Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming,” SIAM Journal on Optimization, vol. 20, no. 3, pp. 1311–1332, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. D. H. Fang, C. Li, and K. F. Ng, “Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming,” Nonlinear Analysis: Theory, Methods & Applications, vol. 73, no. 5, pp. 1143–1159, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. M. A. Goberna, V. Jeyakumar, and M. A. López, “Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities,” Nonlinear Analysis: Theory, Methods & Applications, vol. 68, no. 5, pp. 1184–1194, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. M. A. Goberna and M. A. López, Linear Semi-Infinite Optimization, vol. 2, John Wiley & Sons, Chichester, UK, 1998. View at MathSciNet
  9. V. Jeyakumar, “Constraint qualifications characterizing Lagrangian duality in convex optimization,” Journal of Optimization Theory and Applications, vol. 136, no. 1, pp. 31–41, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. V. Jeyakumar and H. Mohebi, “Limiting ϵ-subgradient characterizations of constrained best approximation,” Journal of Approximation Theory, vol. 135, no. 2, pp. 145–159, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  11. C. Li, K. F. Ng, and T. K. Pong, “Constraint qualifications for convex inequality systems with applications in constrained optimization,” SIAM Journal on Optimization, vol. 19, no. 1, pp. 163–187, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. W. Li, C. Nahak, and I. Singer, “Constraint qualifications for semi-infinite systems of convex inequalities,” SIAM Journal on Optimization, vol. 11, no. 1, pp. 31–52, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. H. J. Greenberg and W. P. Pierskalla, “Quasi-conjugate functions and surrogate duality,” Cahiers du Centre d'Études de Recherche Opérationnelle, vol. 15, pp. 437–448, 1973. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. D. G. Luenberger, “Quasi-convex programming,” SIAM Journal on Applied Mathematics, vol. 16, pp. 1090–1095, 1968. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. J. P. Penot and M. Volle, “On quasi-convex duality,” Mathematics of Operations Research, vol. 15, no. 4, pp. 597–625, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  16. S. Suzuki and D. Kuroiwa, “Set containment characterization for quasiconvex programming,” Journal of Global Optimization, vol. 45, no. 4, pp. 551–563, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. S. Suzuki and D. Kuroiwa, “Optimality conditions and the basic constraint qualification for quasiconvex programming,” Nonlinear Analysis: Theory, Methods & Applications, vol. 74, no. 4, pp. 1279–1285, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. S. Suzuki and D. Kuroiwa, “On set containment characterization and constraint qualification for quasiconvex programming,” Journal of Optimization Theory and Applications, vol. 149, no. 3, pp. 554–563, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. C. Zălinescu, Convex Analysis in General Vector Spaces, World Scientific Publishing, River Edge, NJ, USA, 2002. View at MathSciNet
  20. P. T. Thach, “Diewert-Crouzeix conjugation for general quasiconvex duality and applications,” Journal of Optimization Theory and Applications, vol. 86, no. 3, pp. 719–743, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. J. E. Martínez-Legaz and P. H. Sach, “A new subdifferential in quasiconvex analysis,” Journal of Convex Analysis, vol. 6, no. 1, pp. 1–11, 1999. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet