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

DOI10.1007/s10898-023-01305-9OpenAlexW4381618408MaRDI QIDQ6183088

Wen-Xun Xing, Cheng Lu, Jitao Ma, Zhi-bin Deng

Publication date: 26 January 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-023-01305-9

zbMATH Keywords

quadratic optimizationsemidefinite relaxationsparsity patternmagnitude least-square problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Angular synchronization by eigenvectors and semidefinite programming
• Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
• Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
• Decomposition of arrow type positive semidefinite matrices with application to topology optimization
• Chordal decomposition in operator-splitting methods for sparse semidefinite programs
• Phase recovery, MaxCut and complex semidefinite programming
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Nonconvex Phase Synchronization
• Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
• Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
• Designing Unimodular Codes Via Quadratic Optimization
• Fast Unit-Modulus Least Squares With Applications in Beamforming
• An Efficient Global Algorithm for Single-Group Multicast Beamforming
• Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
• Complex Quadratic Optimization and Semidefinite Programming
• Unnamed Item

This page was built for publication: A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem