Strong duality for generalized monotropic programming in infinite dimensions

DOI10.1016/j.jmaa.2012.10.052zbMath1259.49055OpenAlexW2017649644WikidataQ58048430 ScholiaQ58048430MaRDI QIDQ1941111

Saba N. Majeed, Regina Sandra Burachik

Publication date: 11 March 2013

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2012.10.052

zbMATH Keywords

convex conesconvex functionsconjugate functionFenchel dualitymonotropic programmingepigraph of a convex function

Mathematics Subject Classification ID

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

Related Items (7)

Zero duality gap conditions via abstract convexity ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ Duality in Countably Infinite Monotropic Programs ⋮ Duality for extended infinite monotropic optimization problems ⋮ Algebraic approach to duality in optimization and applications ⋮ Duality for Optimization Problems with Infinite Sums ⋮ A Simplex Method for Countably Infinite Linear Programs

This page was built for publication: Strong duality for generalized monotropic programming in infinite dimensions