Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
From MaRDI portal
Publication:683728
DOI10.1007/S10898-017-0551-8zbMATH Open1393.90079OpenAlexW2745831421MaRDI QIDQ683728FDOQ683728
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
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
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Convex Optimization in Signal Processing and Communications
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Phase recovery, MaxCut and complex semidefinite programming
- On approximating complex quadratic optimization problems via semidefinite programming relaxations
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Complex Quadratic Optimization and Semidefinite Programming
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Probabilistic analysis of the semidefinite relaxation detector in digital communications
- Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
- Nonconvex phase synchronization
- 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
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
Uses Software
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)
