IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v88y2024i1d10.1007_s10589-024-00558-8.html
   My bibliography  Save this article

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming

Author

Listed:
  • Rui-Jin Zhang

    (Chinese Academy of Sciences
    University of Chinese Academy of Sciences)

  • Xin-Wei Liu

    (Hebei University of Technology)

  • Yu-Hong Dai

    (Chinese Academy of Sciences
    University of Chinese Academy of Sciences)

Abstract

We propose an efficient primal-dual interior-point relaxation algorithm based on a smoothing barrier augmented Lagrangian, called IPRSDP, for solving semidefinite programming problems in this paper. The IPRSDP algorithm has three advantages over classical interior-point methods. Firstly, IPRSDP does not require the iterative points to be positive definite. Consequently, it can easily be combined with the warm-start technique used for solving many combinatorial optimization problems, which require the solutions of a series of semidefinite programming problems. Secondly, the search direction of IPRSDP is symmetric in itself, and hence the symmetrization procedure is not required any more. Thirdly, with the introduction of the smoothing barrier augmented Lagrangian function, IPRSDP can provide the explicit form of the Schur complement matrix. This enables the complexity of forming this matrix in IPRSDP to be comparable to or lower than that of many existing search directions. The global convergence of IPRSDP is established under suitable assumptions. Numerical experiments are made on the SDPLIB set, which demonstrate the efficiency of IPRSDP.

Suggested Citation

  • Rui-Jin Zhang & Xin-Wei Liu & Yu-Hong Dai, 2024. "IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming," Computational Optimization and Applications, Springer, vol. 88(1), pages 1-36, May.
    • Handle: RePEc:spr:coopap:v:88:y:2024:i:1:d:10.1007_s10589-024-00558-8
    DOI: 10.1007/s10589-024-00558-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-024-00558-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-024-00558-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:coopap:v:88:y:2024:i:1:d:10.1007_s10589-024-00558-8. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.