Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems
Tóm tắt
In this paper, we establish some relationships among several constraint qualifications, which characterize strong Lagrangian dualities and total Lagrangian dualities for DC infinite optimization problems.
Tài liệu tham khảo
Dinh, N, Goberna, MA, López, MA: From linear to convex systems: consistency, Farkas’ lemma and applications. J. Convex Anal. 13, 279-290 (2006)
Dinh, N, Goberna, MA, López, MA, Song, TQ: New Farkas-type constraint qualifications in convex infinite programming. ESAIM Control Optim. Calc. Var. 13, 580-597 (2007)
Fang, DH, Li, C, Ng, KF: Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim. 20, 1311-1332 (2009)
Fang, DH, Li, C, Ng, KF: Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming. Nonlinear Anal. 73, 1143-1159 (2010)
Goberna, MA, Jeyakumar, V, López, MA: Necessary and sufficient conditions for solvability of systems of infinite convex inequalities. Nonlinear Anal. 68, 1184-1194 (2008)
Goberna, MA, López, MA: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)
Jeyakumar, V: The strong conical hull intersection property for convex programming. Math. Program., Ser. A 106, 81-92 (2006)
Jeyakumar, V, Mohebi, H: Limiting ϵ-subgradient characterizations of constrained best approximation. J. Approx. Theory 135, 145-159 (2005)
Li, C, Ng, KF, Pong, TK: The SECQ, linear regularity and the strong CHIP for infinite system of closed convex sets in normed linear spaces. SIAM J. Optim. 18, 643-665 (2007)
Li, C, Ng, KF, Pong, TK: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. 19, 163-187 (2008)
Li, W, Nahak, C, Singer, I: Constraint qualifications for semi-infinite systems of convex inequalities. SIAM J. Optim. 11, 31-52 (2000)
Martinez-Legaz, JE, Volle, M: Duality in DC programming: the case of several constraints. J. Math. Anal. Appl. 237, 657-671 (1999)
Sun, XK: Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming. J. Math. Anal. Appl. 414, 590-611 (2014)
Sun, XK, Li, SJ, Zhao, D: Duality and Farkas-type results for DC infinite programming with inequality constraints. Taiwan. J. Math. 17, 1227-1244 (2013)
Fang, DH, Lee, GM, Li, C, Yao, JC: Extended Farkas’s lemmas and strong Lagrange dualities for DC infinite programming. J. Nonlinear Convex Anal. 14, 747-767 (2013)
Fang, DH, Chen, Z: Total Lagrange duality for DC infinite optimization problem. Fixed Point Theory Appl. 2013, 269 (2013)
Zǎlinescu, C: Convex Analysis in General Vector Spaces. World Scientific, Hackensack (2002)
Kortanek, KO: Constructing a perfect duality in infinite programming. Appl. Math. Optim. 3, 357-372 (1977)