Necdet Serhat Aybat

Necdet Serhat Aybat

Auto-generated profile, based on publicly available information

Necdet Serhat Aybat

Department of Industrial and Manufacturing Engineering, Pennsylvania State University, University Park, PA 16802 USA. Xuan Zhang and Qiushui Xu contributed equally to this work

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 June 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
NAN. S. Aybat
N. S. Aybat
ZWZ. Wang
Z. Wang
TLT. Lin
T. Lin
SMS. Ma
S. Ma
Given an undirected graph G = (N, E) of agents N = {1,..., N} connected with edges in E, we study how to compute an optimal decision on which there is consensus among agents and that minimizes the sum of agent-specific private convex composite functions {Φ i } i∈N , where Φ i ≐ ξ i + f i belongs to agent-i. Assuming only agents connected by an edge can communicate, we propose a distributed proximal gradient algorithm (DPGA) for consensus optimization over both unweighted and weighted static (undirected) communication networks. In one iteration, each agent-i computes the prox map of ξ i and gradient of f i , and this is followed by local communication with neighboring agents. We also study its stochastic gradient variant, SDPGA, which can only access to noisy estimates of ∇f i at each agent-i. This computational model abstracts a number of applications in distributed sensing, machine learning and statistical inference. We show ergodic convergence in both suboptimality error and consensus violation for the DPGA and SDPGA with rates O(1/t) and O(1/√t), respectively.

18 July 2018 in Proceedings of the IEEE
Verified
Journal Article
Closed access
SMShiqian Ma
Shiqian Ma
NANecdet Serhat Aybat
Necdet Serhat Aybat
Robust principal component analysis (RPCA) has drawn significant attention in the last decade due to its success in numerous application domains, ranging from bioinformatics, statistics, and machine learning to image and video processing in computer vision. RPCA and its variants such as sparse PCA and stable PCA can be formulated as optimization problems with exploitable special structures. Many specialized efficient optimization methods have been proposed to solve robust PCA and related problems. In this paper, we review existing optimization methods for solving convex and nonconvex relaxations/variants of RPCA, discuss their advantages and disadvantages, and elaborate on their convergence behaviors. We also provide some insights for possible future research directions including new algorithmic frameworks that might be suitable for implementing on multiprocessor setting to handle large-scale problems.

8 March 2015 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
NAN. S. Aybat
N. S. Aybat
GIG. Iyengar
G. Iyengar

12 November 2013 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
NANecdet Serhat Aybat
Necdet Serhat Aybat
DGDonald Goldfarb
Donald Goldfarb
SMShiqian Ma
Shiqian Ma

15 May 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
DGDiyako Ghaderyan
Diyako Ghaderyan
NANecdet Serhat Aybat
Necdet Serhat Aybat
A. Pedro AguiarA. Pedro Aguiar
A. Pedro Aguiar
FPFernando Lobo Pereira
Fernando Lobo Pereira
In this paper, we introduce a fast row-stochastic decentralized algorithm, referred to as FRSD, to solve consensus optimization problems over directed communication graphs. The proposed algorithm only utilizes row-stochastic weights, leading to certain practical advantages in broadcast communication settings over those requiring column-stochastic weights. Under the assumption that each node-specific function is smooth and strongly convex, we show that the FRSD iterate sequence converges with a linear rate to the optimal consensus solution. In contrast to the existing methods for directed networks, FRSD enjoys linear convergence without employing a gradient tracking (GT) technique explicitly, rather it implements GT implicitly with the use of a novel momentum term, which leads to a significant reduction in communication and storage overhead for each node when FRSD is implemented for solving high-dimensional problems over small-to-medium scale networks. In the numerical tests, we compare FRSD with other state-of-the-art methods, which use row-stochastic and/or column-stochastic weights.

19 March 2024 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
XZXuan Zhang
Xuan Zhang
NANecdet Serhat Aybat
Necdet Serhat Aybat
MGMert Gürbüzbalaban
Mert Gürbüzbalaban
We consider strongly-convex-strongly-concave saddle point problems assuming we have access to unbiased stochastic estimates of the gradients. We propose a stochastic accelerated primal-du...