Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Phase Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Global Algorithm for Single-Group Multicast Beamforming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Optimized Radar Codes With a Peak to Average Power Ratio Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Optimization in Signal Processing and Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating complex quadratic optimization problems via semidefinite programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Unimodular Codes Via Quadratic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase recovery, MaxCut and complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Quadratic Optimization and Semidefinite Programming / rank
 
Normal rank

Revision as of 02:15, 15 July 2024

scientific article
Language Label Description Also known as
English
Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
scientific article

    Statements

    Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2018
    0 references
    quadratic programming
    0 references
    semidefinite relaxation
    0 references
    branch-and-bound
    0 references
    global optimization
    0 references

    Identifiers