Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917997976748032 |
|---|---|
| author | Qu, Zheng Zeng, Tianyou Lou, Yuchen |
| author_facet | Qu, Zheng Zeng, Tianyou Lou, Yuchen |
| contents | We consider the problem of maximizing a convex quadratic function over a bounded polyhedral set. We design a new framework based on SDP relaxations and cutting plane methods for solving the associated reference value problem. The major novelty is a new way to generate valid cuts through the doubly nonnegative (DNN) relaxation. We establish various theoretical properties of the DNN relaxation, including its equivalence with the Shor relaxation of an equivalent quadratically constrained problem, the strong duality, and the generation of valid cuts from an approximate solution of the DNN relaxation returned by an arbitrary SDP solver. Computational results on both real and synthetic data demonstrate the efficiency of the proposed method and its ability to solve high-dimensional problems with dense data. In particular, our new algorithm successfully solves in 3 days the reference value problem arising from computational biology for a dataset containing more than 300,000 instances of dimension 78. In contrast, CPLEX or Gurobi is estimated to require years of computational time for the same dataset on the same computing platform. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_05930 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation Qu, Zheng Zeng, Tianyou Lou, Yuchen Optimization and Control 90C20, 90C22, 90C26, 90C59 We consider the problem of maximizing a convex quadratic function over a bounded polyhedral set. We design a new framework based on SDP relaxations and cutting plane methods for solving the associated reference value problem. The major novelty is a new way to generate valid cuts through the doubly nonnegative (DNN) relaxation. We establish various theoretical properties of the DNN relaxation, including its equivalence with the Shor relaxation of an equivalent quadratically constrained problem, the strong duality, and the generation of valid cuts from an approximate solution of the DNN relaxation returned by an arbitrary SDP solver. Computational results on both real and synthetic data demonstrate the efficiency of the proposed method and its ability to solve high-dimensional problems with dense data. In particular, our new algorithm successfully solves in 3 days the reference value problem arising from computational biology for a dataset containing more than 300,000 instances of dimension 78. In contrast, CPLEX or Gurobi is estimated to require years of computational time for the same dataset on the same computing platform. |
| title | Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation |
| topic | Optimization and Control 90C20, 90C22, 90C26, 90C59 |
| url | https://arxiv.org/abs/2302.05930 |