The minimal cone for conic linear programming

DOI10.1007/s10288-011-0170-zzbMath1235.90116OpenAlexW2012400634MaRDI QIDQ766252

Qinghong Zhang

Publication date: 23 March 2012

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-011-0170-z

zbMATH Keywords

dualityminimal conesfacial reduction algorithmsconic linear programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

A note on the minimal cone for conic linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularizing the abstract convex program
• Some applications of optimization in matrix theory
• An exact duality theory for semidefinite programming and its complexity implications
• Understanding linear semi-infinite programming via linear programming over cones
• Strong Duality for Semidefinite Programming
• On the Closedness of the Linear Image of a Closed Convex Cone
• Convex Analysis
• Perfect duality in semi-infinite and semidefinite programming

This page was built for publication: The minimal cone for conic linear programming