IDEAS home Printed from https://ideas.repec.org/p/tiu/tiucen/9b41ff5e-2808-4d12-a58c-06096a99fce1.html
   My bibliography  Save this paper

Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster

Author

Listed:
  • Ivanov, I.D.
  • de Klerk, E.

    (Tilburg University, Center For Economic Research)

Abstract

No abstract is available for this item.

Suggested Citation

  • Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.
    • Handle: RePEc:tiu:tiucen:9b41ff5e-2808-4d12-a58c-06096a99fce1
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/821038/dp2007-20.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yu., 2000. "Squared functional systems and optimization problems," LIDAM Reprints CORE 1472, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    3. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Discussion Paper 2006-26, Tilburg University, Center for Economic Research.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. de Klerk, E. & Sotirov, R., 2007. "Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem," Discussion Paper 2007-44, Tilburg University, Center for Economic Research.
    2. Thorsten Koch & Ted Ralphs & Yuji Shinano, 2012. "Could we use a million cores to solve an integer program?," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(1), pages 67-93, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Other publications TiSEM 9b41ff5e-2808-4d12-a58c-0, Tilburg University, School of Economics and Management.
    2. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    3. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.
    4. Wang, Wei & Xu, Huifu & Ma, Tiejun, 2023. "Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation," European Journal of Operational Research, Elsevier, vol. 306(1), pages 322-347.
    5. Kato, Naohiro & Kuriki, Satoshi, 2013. "Likelihood ratio tests for positivity in polynomial regressions," Journal of Multivariate Analysis, Elsevier, vol. 115(C), pages 334-346.
    6. Sturm, J.F. & Zhang, S., 2001. "On Cones of Nonnegative Quadratic Functions," Discussion Paper 2001-26, Tilburg University, Center for Economic Research.
    7. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    8. Meng-Meng Zheng & Zheng-Hai Huang & Sheng-Long Hu, 2022. "Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space," Journal of Global Optimization, Springer, vol. 84(2), pages 415-440, October.
    9. Monique Laurent, 2003. "Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 871-883, November.
    10. Thomas A. Weber, 2017. "Optimal switching between cash-flow streams," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(3), pages 567-600, December.
    11. Liyun Dai & Bican Xia, 2015. "Smaller SDP for SOS decomposition," Journal of Global Optimization, Springer, vol. 63(2), pages 343-361, October.
    12. E. de Klerk & C. Roos & T. Terlaky, 1998. "Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, Springer, vol. 2(1), pages 51-69, March.
    13. Wong, Man Hong & Zhang, Shuzhong, 2013. "Computing best bounds for nonlinear risk measures with partial information," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 204-212.
    14. de Klerk, E. & den Hertog, D. & Elabwabi, G., 2008. "On the complexity of optimization over the standard simplex," European Journal of Operational Research, Elsevier, vol. 191(3), pages 773-785, December.
    15. Badenbroek, Riley & Dahl, Joachim, 2020. "An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK," Other publications TiSEM bcf7ef05-e4e6-4ce8-b2e9-6, Tilburg University, School of Economics and Management.
    16. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Discussion Paper 2005-73, Tilburg University, Center for Economic Research.
    17. de Klerk, Etienne & Pasechnik, Dmitrii V., 2004. "Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms," European Journal of Operational Research, Elsevier, vol. 157(1), pages 39-45, August.
    18. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Other publications TiSEM 224cf14f-b76a-4803-a57d-3, Tilburg University, School of Economics and Management.
    19. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Other publications TiSEM 43a1152a-8130-4e42-851b-e, Tilburg University, School of Economics and Management.
    20. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:tiu:tiucen:9b41ff5e-2808-4d12-a58c-06096a99fce1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Richard Broekman (email available below). General contact details of provider: http://center.uvt.nl .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.