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

DOI10.1007/S10898-017-0551-8MaRDI QIDQ683728zbMATH OpenOpenAlexFDO

Authors Cheng Lu, Shu-Cherng Fang, Zhibin Deng, Weiqiang 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

quadratic programmingglobal optimizationbranch-and-boundsemidefinite relaxation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7366738
• A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
• A branch and bound reduced algorithm for quadratic programming problems with quadratic constraints

Cites work

• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A polyhedral branch-and-cut approach to global optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• An Efficient Global Algorithm for Single-Group Multicast Beamforming
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
• Complex Quadratic Optimization and Semidefinite Programming
• Convex Optimization in Signal Processing and Communications
• Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint
• Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
• Designing Unimodular Codes Via Quadratic Optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Nonconvex phase synchronization
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
• Phase recovery, MaxCut and complex semidefinite programming
• Probabilistic analysis of the semidefinite relaxation detector in digital communications
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(3)

• 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
• A new global algorithm for homogeneous complex quadratic programming problems and applications

Describes a project that uses

Uses Software

• SeDuMi

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683728)