Duality and Farkas-type results for DC infinite programming with inequality constraints

From MaRDI portal
Publication:373707

DOI10.11650/tjm.17.2013.2675zbMath1276.49028OpenAlexW1994664558MaRDI QIDQ373707

Dan Zhao, Xiang-Kai Sun, Sheng Jie Li

Publication date: 24 October 2013

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/2675




Related Items (21)

A comparison of alternative c-conjugate dual problems in infinite convex optimizationConstraint qualifications in convex vector semi-infinite optimizationSome characterizations of robust optimal solutions for uncertain convex optimization problemsSome characterizations of duality for DC optimization with composite functionsFenchel-Lagrange duality for DC infinite programs with inequality constraintsSome dual characterizations of Farkas-type results for fractional programming problemsTotal Lagrange duality for DC infinite optimization problemsExtended Farkas lemma and strong duality for composite optimization problems with DC functionsFarkas-Type Theorems and Applications: From IPH Functions to ICR FunctionsA note on optimality conditions for DC programs involving composite functionsFarkas-type results for constrained fractional programming with DC functionsAutowave processes in continual chains of unidirectionally coupled oscillatorsExtended Farkas's lemmas and strong dualities for conic programming involving composite functionsSequential optimality conditions for fractional optimization with applications to vector optimizationSome relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problemsOptimality conditions and total dualities for conic programming involving composite functionOn robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty dataMin-sup-type zero duality gap properties for DC composite optimization problemNew regularity conditions and Fenchel dualities for DC optimization problems involving composite functionsA note on the paper ``Optimality conditions for vector optimization problems with difference of convex mapsOptimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs




This page was built for publication: Duality and Farkas-type results for DC infinite programming with inequality constraints