Abstract

We present conditions, which completely characterize Farkas' lemma for cone-convex systems, and obtain strong duality characterizations for convex optimization problems. In particular, we establish a necessary and sufficient closed cone condition for the Farkas lemma. As an application, we obtain necessary and sufficient conditions for the strong duality of convex second-order cone programming problems.

Author information

Contact details are reproduced from the original publication and may be historical.

Vaithilingam Jeyakumar

School of Mathematics, University of New South Wales, Sydney 2052, Australia

jeya@maths.unsw.edu.au

Sangho Kum

Dept. of Mathematics Education, Chungbuk National University, Cheongju 361-763, Korea

shkum@chungbuk.ac.kr

Gue Myung Lee

Dept. of Applied Mathematics, Pukyong National University, Pusan 608-737, Korea

gmlee@pknu.ac.kr

Keywords

  • Farkas lemma
  • cone-convex systems
  • strong duality
  • closed cone condition
  • second-order cone programming

References

  1. F. Alizadeh, D. Goldfarb: Second-order cone programming, Math. Program., Ser. B 95 (2003) 3–51.https://doi.org/10.1007/s10107-002-0339-5Google Scholar
  2. E. D. Andersen, C. Roos, T. Terlaky: Notes on duality in second order and p-order cone optimization, Optimization 51 (2002) 627–643.https://doi.org/10.1080/0233193021000030751Google Scholar
  3. R. I. Bot, G. Wanka: Farkas-type results with conjugate functions, SIAM J. Optim. 15 (2005) 540–554.https://doi.org/10.1137/030602332Google Scholar
  4. R. S. Burachik, V. Jeyakumar: Dual condition for the convex subdifferential sum formula with applications, J. Convex Analysis 12 (2005) 279–290.https://doi.org/10.68381/jca12020Google Scholar
  5. B. D. Craven: Control and Optimization, Chapman & Hall, London (1995).https://doi.org/10.1007/978-1-4899-7226-2Google Scholar
  6. N. Dinh, V. Jeyakumar, G. M. Lee: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming, J. Optimization Theory Appl. 125 (2005) 85–112.https://doi.org/10.1007/s10957-004-1712-8Google Scholar
  7. N. Dinh, M. A. Goberna, M. A. López: From linear to convex systems: Consistency, Farkas’ lemma and application, J. Convex Analysis 13 (2006) 113–133.https://doi.org/10.68381/jca13008Google Scholar
  8. B. M. Glover: A generalized Farkas lemma with applications to quasidifferentiable programming, Z. Oper. Res., Ser. A 26 (1982) 125–141.https://doi.org/10.1007/BF01917106Google Scholar
  9. M. A. Goberna, M. A. López: Linear Semi-Infinite Optimization, Wiley, Chichester (1998).Google Scholar
  10. J. Gwinner: Results of Farkas type, Numer. Funct. Anal. Optimization 9 (1987) 471–520.https://doi.org/10.1080/01630568708816244Google Scholar
  11. J. Gwinner: Corrigendum and addendum to “Results of Farkas type”, Numer. Funct. Anal. Optimization 10 (1987) 415–418.https://doi.org/10.1080/01630568908816311Google Scholar
  12. V. Jeyakumar: Farkas lemma: generalizations, in: Encyclopedia of Optimization, Vol. 2, Kluwer, Dordrecht (2001) 87–91.Google Scholar
  13. V. Jeyakumar, B. M. Glover: Nonlinear extensions of Farkas lemma with applications to global optimization and least squares, Math. Oper. Res. 20(4) (1995) 818–837.https://doi.org/10.1287/moor.20.4.818Google Scholar
  14. V. Jeyakumar, G. M. Lee, N. Dinh: Characterizations of solution sets of convex vector minimization problems, Eur. J. Oper. Res. 174 (2006) 1380–1395.https://doi.org/10.1016/j.ejor.2005.05.007Google Scholar
  15. V. Jeyakumar, A. M. Rubinov, B. M. Glover, Y. Ishizuka: Inequality systems and global optimization, J. Math. Anal. Appl. 202 (1996) 900–919.https://doi.org/10.1006/jmaa.1996.0353Google Scholar
  16. V. Jeyakumar, A. Zaffaroni: Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization, Numer. Funct. Anal. Optimization 17 (1996) 323–343.https://doi.org/10.1080/01630569608816697Google Scholar
  17. M. S. Lobo, L. Vandenberghe, S. Boyd, H. Lebret: Applications of second-order cone programming, Linear Algebra Appl. 284 (1998) 193–228.https://doi.org/10.1016/S0024-3795(98)10032-0Google Scholar
  18. M. A. López, J.-E. Martinez-Legaz: Farkas-type theorems for positively homogeneous semi-infinite systems, Optimization 54 (2005) 421–431.https://doi.org/10.1080/02331930500100205Google Scholar
  19. S. P. Schurr, A. L. Tits, D. P. O’Leary: Universal duality in conic convex optimization, Math. Program., Ser. A 109 (2006) 69–88.https://doi.org/10.1007/s10107-005-0690-4Google Scholar
  20. R. T. Rockafellar, R. J.-B. Wets: Variational Analyis, Springer, Berlin (1998).https://doi.org/10.1007/978-3-642-02431-3Google Scholar
  21. C. Zalinescu: Convex Analysis in General Vector Spaces, World Scientific, Singapore (2002).https://doi.org/10.1142/5021Google Scholar

Suggested citation

V. Jeyakumar, S. Kum, G. M. Lee. “Necessary and Sufficient Conditions for Farkas' Lemma for Cone Systems and Second-Order Cone Programming Duality.” Journal of Convex Analysis 15 (2008), No. 1, 63–71. https://doi.org/10.68381/jca15005

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2008. Rights now held by Banach Press LLC.