Cart
Create Account
Sign In
Already purchased this program?
Login to View
This video program is a part of the Premium package:
Proximal Distance Algorithm For Nonconvex Qcqp With Beamforming Applications
- IEEE MemberUS $11.00
- Society MemberUS $0.00
- IEEE Student MemberUS $11.00
- Non-IEEE MemberUS $15.00
Proximal Distance Algorithm For Nonconvex Qcqp With Beamforming Applications
This paper studies nonconvex quadratically constrained quadratic program (QCQP), which is known to be NP-hard in general. In the past decades, various approximate approaches have been developed to tackle the QCQP, including semidefinite relaxation (SDR),
This paper studies nonconvex quadratically constrained quadratic program (QCQP), which is known to be NP-hard in general. In the past decades, various approximate approaches have been developed to tackle the QCQP, including semidefinite relaxation (SDR),
