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. 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.
    3. Kato, Naohiro & Kuriki, Satoshi, 2013. "Likelihood ratio tests for positivity in polynomial regressions," Journal of Multivariate Analysis, Elsevier, vol. 115(C), pages 334-346.
    4. Sturm, J.F. & Zhang, S., 2001. "On Cones of Nonnegative Quadratic Functions," Discussion Paper 2001-26, Tilburg University, Center for Economic Research.
    5. Liyun Dai & Bican Xia, 2015. "Smaller SDP for SOS decomposition," Journal of Global Optimization, Springer, vol. 63(2), pages 343-361, October.
    6. 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.
    7. Zsolt Darvay & Petra Renáta Rigó, 2024. "New Predictor–Corrector Algorithm for Symmetric Cone Horizontal Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 202(1), pages 50-75, July.
    8. 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.
    9. Jibetean, D. & de Klerk, E., 2006. "Global optimization of rational functions : A semidefinite programming approach," Other publications TiSEM 25febbc3-cd0c-4eb7-9d37-d, Tilburg University, School of Economics and Management.
    10. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    11. Sönke Behrends & Ruth Hübner & Anita Schöbel, 2018. "Norm bounds and underestimators for unconstrained polynomial integer minimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 73-107, February.
    12. Roland Hildebrand, 2022. "Semi-definite Representations for Sets of Cubics on the Two-dimensional Sphere," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 666-675, November.
    13. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Solving infinite-dimensional optimization problems by polynomial approximation," LIDAM Discussion Papers CORE 2010029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    14. Monique Laurent, 2003. "A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 470-496, August.
    15. 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.
    16. Wu, Zhiyou & Tian, Jing & Quan, Jing & Ugon, Julien, 2014. "Optimality conditions and optimization methods for quartic polynomial optimization," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 968-982.
    17. Kirschner, Felix & de Klerk, Etienne, 2024. "A predictor-corrector algorithm for semidefinite programming that uses the factor width cone," Other publications TiSEM 957e76ec-7f75-4e6e-adc4-c, Tilburg University, School of Economics and Management.
    18. Halicka, Margareta, 2002. "Analyticity of the central path at the boundary point in semidefinite programming," European Journal of Operational Research, Elsevier, vol. 143(2), pages 311-324, December.
    19. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    20. 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.

    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.