IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v37y2025i4p962-976.html
   My bibliography  Save this article

A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem

Author

Listed:
  • Forbes Burkowski

    (Cheriton School of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Haesol Im

    (Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

  • Henry Wolkowicz

    (Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada)

Abstract

This paper considers the NP-hard protein side-chain positioning ( SCP ) problem, an important final task of protein structure prediction. We formulate the SCP as an integer quadratic program and derive its doubly nonnegative (DNN) (convex) relaxation. Strict feasibility fails for this DNN relaxation. We apply facial reduction to regularize the problem. This gives rise to a natural splitting of the variables. We then use a variation of the Peaceman-Rachford splitting method to solve the DNN relaxation. The resulting relaxation and rounding procedures provide strong approximate solutions. Empirical evidence shows that almost all our instances of this NP-hard SCP problem, taken from the Protein Data Bank, are solved to provable optimality . Our large problems correspond to solving a DNN relaxation with 2,883,601 binary variables to provable optimality.

Suggested Citation

  • Forbes Burkowski & Haesol Im & Henry Wolkowicz, 2025. "A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem," INFORMS Journal on Computing, INFORMS, vol. 37(4), pages 962-976, July.
    • Handle: RePEc:inm:orijoc:v:37:y:2025:i:4:p:962-976
    DOI: 10.1287/ijoc.2023.0094
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0094
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2023.0094?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
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:inm:orijoc:v:37:y:2025:i:4:p:962-976. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.