A note on the minimal cone for conic linear programming

DOI10.1007/S11590-014-0766-2MaRDI QIDQ2018866zbMATH OpenOpenAlexFDO

Authors 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

conic linear programmingdualityfacial reduction algorithmsminimal cones

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• The minimal cone for conic linear programming
• scientific article; zbMATH DE number 3943577
• A note on converse duality in nonlinear programming with cone constraints
• A primal conical linear programming algorithm
• Erratum to: ``New constraint qualifications and optimality conditions for second order cone programs

Cites work

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

Cited in

(2)

• On minimal valid inequalities for mixed integer conic programs
• The minimal cone for conic linear programming

This page was built for publication: A note on 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 Q2018866)