New primal/dual and successive decomposition algorithms are introduced for nonconvex problems with general structures, generalizing convex cases and extending existing nonconvex methods.
Primal decomposition methods and algorithms for nonconvex problems with applications in optimal zero-forcing transmit and receive beamforming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Decomposition and Successive Decomposition Methods and Algorithms for Nonconvex Optimization
New primal/dual and successive decomposition algorithms are introduced for nonconvex problems with general structures, generalizing convex cases and extending existing nonconvex methods.