A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory

71 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Multiple-Source Adaptation with Domain Classifiers (2020, background): “…2 and 3, one can cast the min-max optimization problem (7) into the following variational form of a DC-programming problem [Tao and An, 1997, 1998, Sriperumbudur and Lanckriet, 2012]: (cid:0) (cid:1) (cid:0) (cid:1) (cid:0) P (cid:1) The DC-programming algorithm works by repeatedly solving…”
Multiple-source adaptation theory and algorithms (2020, background): “Then, (z t ) t is guaranteed to converge to a local minimum of Problem (12) [53, 67].”
Dynamic Pooling for Complex Event Recognition (2013, background): “This follows from the fact that, as happens to EM, CCCP is only guaranteed to converge to a local minima or saddle point [22].”
Joint Optimization of Radio and Computational Resources for Multicell Mobile-Edge Computing (2014, methodology): “M(inimization) algorithm [35], [36]; iii) alternating/successive minimization methods [37]–[39]; and iv) partial linearization methods [32], [40], [41].”