The minimal cone for conic linear programming

DOI10.1007/S10288-011-0170-ZzbMATH Open1235.90116OpenAlexW2012400634MaRDI QIDQ766252FDOQ766252

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

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

Cites Work

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

Cited In (2)

• A note on the minimal cone for conic linear programming
• The minimax direction for the direct product of a convex cone with its application to testing problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q766252)