A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem-Reference-Cited by-同舟云学术

A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem

Published:2023-06-22 Issue:1 Volume:88 Page:115-137
ISSN:0925-5001
Container-title:Journal of Global Optimization
language:en
Short-container-title:J Glob Optim

Author:

Lu Cheng,Ma Jitao,Deng Zhibin^ORCID,Xing Wenxun

Funder

National Natural Science Foundation of China

Fundamental Research Funds for the Central Universities

MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications,Business, Management and Accounting (miscellaneous)

Link

https://link.springer.com/content/pdf/10.1007/s10898-023-01305-9.pdf

Reference29 articles.

1. Arora, A., Tsinos, C.G., Bhavani Shankar, M.R., Chatinotas, S., Ottersten, B.: Efficient algorithms for constant-modulus analog beamforming. IEEE Trans. Signal Process. 70, 756–771 (2022)

2. Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Glob. Optim. 82, 243–262 (2022)

3. Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Glob. Optim. 2022, 1–21 (2022)

4. Bandeira, A.S., Boumal, N., Singer, A.: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization. Math. Program. 163(1–2), 145–167 (2017)

5. Boumal, N.: Nonconvex phase synchronization. SIAM J. Optim. 26(4), 2355–2377 (2016)