On duality gap in linear conic problems

DOI10.1007/s11590-011-0282-6zbMath1280.90085OpenAlexW2290719478MaRDI QIDQ691369

Constantin Zalinescu

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0282-6

zbMATH Keywords

duality gaplinear conic problems

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (6)

An exact explicit dual for the linear copositive programming problem ⋮ Descent methods with computational errors in Banach spaces ⋮ Revisiting some rules of convex analysis ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Unnamed Item ⋮ A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on d-stability of convex programs and limiting Lagrangians
• On Zero Duality Gap and the Farkas Lemma for Conic Programming
• Convex Analysis

This page was built for publication: On duality gap in linear conic problems