A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem
From MaRDI portal
Abstract: We formulate a doubly nonnegative (DNN) relaxation of the protein side-chain positioning (SCP) problem. We inherit the natural splitting of variables that stems from the facial reduction technique in the semidefinite relaxation. We solve the relaxation using a variant of the Peaceman-Rachford splitting method. Our numerical experiments show that we solve almost all instances of the NP-hard SCP problem to optimality.
This page was built for publication: A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348297)
