Farkas' lemma: three decades of generalizations for mathematical optimization

被引：38
作者：
Dinh, N. [1 ]
Jeyakumar, V. [2 ]
机构：
[1] Vietnam Natl Univ Ho Chi Minh City, Int Univ, Dept Math, Ho Chi Minh City, Vietnam
[2] Univ New S Wales, Dept Appl Math, Sydney, NSW 2052, Australia
来源：
TOP | 2014年 / 22卷 / 01期
基金：
澳大利亚研究理事会;
关键词：
Generalized Farkas' lemma; Optimality; Duality; Mathematical optimization; CONSTRAINT QUALIFICATIONS; OPTIMALITY CONDITIONS; CONVEX-OPTIMIZATION; INEQUALITY SYSTEMS; PROGRAMMING DUALITY; DC FUNCTIONS; SUBDIFFERENTIAL CALCULUS; GLOBAL OPTIMIZATION; CONJUGATE DUALITY; VECTOR-SPACES;
D O I：
10.1007/s11750-014-0319-y
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we present a survey of generalizations of the celebrated Farkas's lemma, starting from systems of linear inequalities to a broad variety of non-linear systems. We focus on the generalizations which are targeted towards applications in continuous optimization. We also briefly describe the main applications of generalized Farkas' lemmas to continuous optimization problems.
引用
收藏
页码：1 / 22
页数：22
相关论文
共 88 条
[1]   A convex polynomial that is not sos-convex [J].
Ahmadi, Amir Ali ;
Parrilo, Pablo A. .
MATHEMATICAL PROGRAMMING, 2012, 135 (1-2) :275-292
[2]   The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems [J].
An, LTH ;
Tao, PD .
ANNALS OF OPERATIONS RESEARCH, 2005, 133 (1-4) :23-46
[3]  
[Anonymous], 2010, LECT NOTES EC MATH S
[4]  
[Anonymous], GEOMETRICAL FUNCTION
[5]  
Ben-Tal A., 2000, LECT MODERN CONVEX O
[6]   LINEAR EQUATIONS AND INEQUALITIES ON FINITE DIMENSIONAL, REAL OR COMPLEX, VECTOR SPACES - A UNIFIED THEORY [J].
BENISRAEL, A .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1969, 27 (02) :367-+
[7]  
BenTal A, 2009, PRINC SER APPL MATH, P1
[8]   Theory and Applications of Robust Optimization [J].
Bertsimas, Dimitris ;
Brown, David B. ;
Caramanis, Constantine .
SIAM REVIEW, 2011, 53 (03) :464-501
[9]   ADJOINT PROCESS DUALITY [J].
BORWEIN, JM .
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (03) :403-434
[10]   New constraint qualification and conjugate duality for composed convex optimization problems [J].
Bot, R. I. ;
Grad, S. M. ;
Wanka, G. .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2007, 135 (02) :241-255
123456789