Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2503.10203 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916651757207552 |
|---|---|
| author | Zheng, Yukai Li, Qingna |
| author_facet | Zheng, Yukai Li, Qingna |
| contents | In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as 0/1 programming and is extremely challenging due to its combinatorial properties. As a quadratic semi-assignment problem (QSAP), the CPD problem has been proved to be equivalent to its continuous relaxation problem (RQSAP), in terms of sharing the same optimal objective value. However, since the current algorithm for solving this RQSAP uses the projected Newton method, which requires direct computation of the Hessian matrix, its computational cost remains quite high. Precisely for this reason, we choose to employ the spectral projected gradient (SPG) method to solve the CPD problem, whose effectiveness relies on choosing the step lengths according to novel ideas that are related to the spectrum of the underlying local Hessian. Specifically, we apply the SPG method in two distinct ways: direct solving the relaxation problem and applying a penalty method. Numerical results on benchmark instances verify the superior performance of our approach over the current algorithms in both quality and efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10203 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Spectral Projected Gradient Method for Computational Protein Design problem Zheng, Yukai Li, Qingna Optimization and Control In this paper, we consider the computational protein design (CPD) problem, which is usually modeled as 0/1 programming and is extremely challenging due to its combinatorial properties. As a quadratic semi-assignment problem (QSAP), the CPD problem has been proved to be equivalent to its continuous relaxation problem (RQSAP), in terms of sharing the same optimal objective value. However, since the current algorithm for solving this RQSAP uses the projected Newton method, which requires direct computation of the Hessian matrix, its computational cost remains quite high. Precisely for this reason, we choose to employ the spectral projected gradient (SPG) method to solve the CPD problem, whose effectiveness relies on choosing the step lengths according to novel ideas that are related to the spectrum of the underlying local Hessian. Specifically, we apply the SPG method in two distinct ways: direct solving the relaxation problem and applying a penalty method. Numerical results on benchmark instances verify the superior performance of our approach over the current algorithms in both quality and efficiency. |
| title | A Spectral Projected Gradient Method for Computational Protein Design problem |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.10203 |