Skip to main content
SpringerLink
Log in

A note on the minimal cone for conic linear programming

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ramana, M.V., Tunçel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Optim. 7, 641–662 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Rockafellar, R.T.: Convex analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  3. Zhang, Q.: Understanding linear semi-infinite programming via linear programming over cones. Optimization 59, 1247–1258 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  4. Zhang, Q.: Embedding methods for semidefinite programming. Optim. Methods Softw. 27, 461–482 (2012)

  5. Zhang, Q.: The minimal cone for conic linear programming. 4OR 9, 403–416 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhang, Q., Chen, G., Zhang, T.: Duality formulation in semidefinite programming. J. Ind. Manag. Optim. 6, 881–893 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Northern Michigan University, Marquette, MI, 49855, USA

    Qinghong Zhang

Authors
  1. Qinghong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qinghong Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0766-2

Keywords

Search

Navigation