Farkas-Type results for general composed convex optimization problems with inequality constraints

DOI10.7153/mia-13-10zbMath1206.90119OpenAlexW2322044356MaRDI QIDQ5189752

Xian-Jun Long, Donal O'Regan, Nan-Jing Huang

Publication date: 11 March 2010

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7153/mia-13-10

zbMATH Keywords

Farkas-type resultsFenchel-Lagrange dualityconjugate dualfinitely many convex constraintsgeneral composed convex optimization problems

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (4)

Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Approximate optimality conditions for composite convex optimization problems ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization

This page was built for publication: Farkas-Type results for general composed convex optimization problems with inequality constraints