Abstract
In a recent paper by the author (4OR, 9:403–416, 2011), a recursive procedure to obtain the minimal cone for the constraint system of a conic linear programming problem has been developed. In this short note, we point out some minor errors for this recursive procedure, make corrections of these errors, and present some interesting results pertaining to the recursive process.
Similar content being viewed by others
References
Ramana, M.V., Tunçel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 641–662 (1997)
Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)
Zhang, Q.: Understanding linear semi-infinite programming via linear programming over cones. Optimization 59, 1247–1258 (2010)
Zhang, Q.: Embedding methods for semidefinite programming. Optim. Methods Softw. 27, 461–482 (2012)
Zhang, Q.: The minimal cone for conic linear programming. 4OR 9, 403–416 (2011)
Zhang, Q., Chen, G., Zhang, T.: Duality formulation in semidefinite programming. J. Ind. Manag. Optim. 6, 881–893 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Q. A note on the minimal cone for conic linear programming. Optim Lett 9, 505–512 (2015). https://doi.org/10.1007/s11590-014-0766-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-014-0766-2