A note on the minimal cone for conic linear programming

DOI10.1007/s11590-014-0766-2zbMath1317.90194OpenAlexW2043147800MaRDI QIDQ2018866

Qinghong Zhang

Publication date: 25 March 2015

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

Full work available at URL: https://doi.org/10.1007/s11590-014-0766-2

zbMATH Keywords

dualityminimal conesfacial reduction algorithmsconic linear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Cites Work

• Duality formulations in semidefinite programming
• The minimal cone for conic linear programming
• Embedding methods for semidefinite programming
• Understanding linear semi-infinite programming via linear programming over cones
• Strong Duality for Semidefinite Programming
• Convex Analysis

This page was built for publication: A note on the minimal cone for conic linear programming