New results on eliminating the duality gap of the second-order-cone reformulation for extended trust-region subproblem with two intersecting cuts
In this paper, we consider the nonconvex extended trust-region subproblem with two intersecting linear inequality constraints, $(\mathrm{ETR}_2)$, and use a sequence of semi-definite programming (SDP) problems with second-order-cone(SOC) constraints to eliminate the duality gap of the SOC reformulat...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Académie des sciences
2024-11-01
|
| Series: | Comptes Rendus. Mathématique |
| Subjects: | |
| Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.661/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we consider the nonconvex extended trust-region subproblem with two intersecting linear inequality constraints, $(\mathrm{ETR}_2)$, and use a sequence of semi-definite programming (SDP) problems with second-order-cone(SOC) constraints to eliminate the duality gap of the SOC reformulation for $(\mathrm{ETR}_2)$. We first narrow the duality gap of the SOC reformulation by adding a new appropriate SOC constraint, and a sufficient condition is presented to characterize when the new SOC constraint is valid. Then we establish an iterative algorithm and the results of numerical experiments show that the iterative algorithm works efficiently in eliminating the SDPR-SOCR gap of $(\mathrm{ETR}_2)$. |
|---|---|
| ISSN: | 1778-3569 |