kkt points
Recently Published Documents


TOTAL DOCUMENTS

9
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

Author(s):  
Sen Su ◽  
Li Sun ◽  
Zhongbao Zhang ◽  
Gen Li ◽  
Jielun Qu

Recently, reconciling social networks receives significant attention. Most of the existing studies have limitations in the following three aspects: multiplicity, comprehensiveness and robustness. To address these three limitations, we rethink this problem and propose the MASTER framework, i.e., across Multiple social networks, integrate Attribute and STructure Embedding for Reconciliation. In this framework, we first design a novel Constrained Dual Embedding model by simultaneously embedding and reconciling multiple social networks to formulate our problem into a unified optimization. To address this optimization, we then design an effective algorithm called NS-Alternating. We also prove that this algorithm converges to KKT points. Through extensive experiments on real-world datasets, we demonstrate that MASTER outperforms the state-of-the-art approaches.


2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Caihua Chen ◽  
Yuan Shen ◽  
Yanfei You

We consider a class of linearly constrained separable convex programming problems whose objective functions are the sum of three convex functions without coupled variables. For those problems, Han and Yuan (2012) have shown that the sequence generated by the alternating direction method of multipliers (ADMM) with three blocks converges globally to their KKT points under some technical conditions. In this paper, a new proof of this result is found under new conditions which are much weaker than Han and Yuan’s assumptions. Moreover, in order to accelerate the ADMM with three blocks, we also propose a relaxed ADMM involving an additional computation of optimal step size and establish its global convergence under mild conditions.


2012 ◽  
Vol 56 (4) ◽  
pp. 1463-1499 ◽  
Author(s):  
Joydeep Dutta ◽  
Kalyanmoy Deb ◽  
Rupesh Tulshyan ◽  
Ramnik Arora
Keyword(s):  

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
X. Zhao ◽  
S. G. Zhang ◽  
Q. H. Liu

We present a combined homotopy interior-point method for a general multiobjective programming problem. For solving the KKT points of the multiobjective programming problem, the homotopy equation is constructed. We prove the existence and convergence of a smooth homotopy path from almost any initial interior point to a solution of the KKT system under some basic assumptions.


2006 ◽  
Vol 130 (2) ◽  
pp. 369-376
Author(s):  
Y. B. Zhao ◽  
D. Li
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document