Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming

DOI10.1007/s10898-017-0551-8zbMath1393.90079OpenAlexW2745831421MaRDI QIDQ683728

Shu-Cherng Fang, Cheng Lu, Zhi-bin Deng, Wei-Qiang Zhang

Publication date: 9 February 2018

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

Full work available at URL: https://doi.org/10.1007/s10898-017-0551-8

zbMATH Keywords

global optimizationquadratic programmingbranch-and-boundsemidefinite relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

New semidefinite relaxations for a class of complex quadratic programming problems ⋮ A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem

Uses Software

• SeDuMi

Cites Work

• Unnamed Item
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• A polyhedral branch-and-cut approach to global optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• Phase recovery, MaxCut and complex semidefinite programming
• Nonconvex Phase Synchronization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• 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
• An Efficient Global Algorithm for Single-Group Multicast Beamforming
• Convex Optimization in Signal Processing and Communications
• Complex Quadratic Optimization and Semidefinite Programming

This page was built for publication: Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming