Necdet Serhat Aybat

Orcid: 0000-0002-9839-9894

Affiliations:
  • Penn State, University Park, USA


According to our database1, Necdet Serhat Aybat authored at least 37 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lp quasi-norm minimization: algorithm and applications.
EURASIP J. Adv. Signal Process., December, 2024

Robust Accelerated Primal-Dual Methods for Computing Saddle Points.
SIAM J. Optim., March, 2024

A Fast Row-Stochastic Decentralized Method for Distributed Optimization Over Directed Graphs.
IEEE Trans. Autom. Control., January, 2024

Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax Optimization.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Randomized Primal-Dual Methods with Adaptive Step Sizes.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Randomized Gossiping With Effective Resistance Weights: Performance Guarantees and Applications.
IEEE Trans. Control. Netw. Syst., 2022

A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function.
IEEE Trans. Autom. Control., 2022

On the Analysis of Inexact Augmented Lagrangian Schemes for Misspecified Conic Convex Programs.
IEEE Trans. Autom. Control., 2022

A Variance-Reduced Stochastic Accelerated Primal Dual Algorithm.
CoRR, 2022

SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems.
SIAM J. Optim., 2021

A Fast Row-Stochastic Decentralized Optimization Method Over Directed Graphs.
CoRR, 2021

2020
Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions.
SIAM J. Optim., 2020

2019
End-to-End Distributed Flow Control for Networks with Nonconcave Utilities.
IEEE Trans. Netw. Sci. Eng., 2019

A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks.
SIAM J. Optim., 2019

A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks.
Autom., 2019

A Universally Optimal Multistage Accelerated Stochastic Gradient Method.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Lp Quasi-norm Minimization.
Proceedings of the 53rd Asilomar Conference on Signals, Systems, and Computers, 2019

2018
Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization.
IEEE Trans. Autom. Control., 2018

Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants.
Proc. IEEE, 2018

2017
Non-concave network utility maximization: A distributed optimization approach.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Multi-agent constrained optimization of a strongly convex function.
Proceedings of the 2017 IEEE Global Conference on Signal and Information Processing, 2017

Decentralized computation of effective resistances and acceleration of consensus algorithms.
Proceedings of the 2017 IEEE Global Conference on Signal and Information Processing, 2017

Non-concave network utility maximization in connectionless networks: A fully distributed traffic allocation algorithm.
Proceedings of the 2017 American Control Conference, 2017

Multi-agent constrained optimization of a strongly convex function over time-varying directed networks.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
A primal-dual method for conic constrained distributed optimization problems.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints.
Proceedings of the 2016 American Control Conference, 2016

Distributed primal-dual method for multi-agent sharing problem with conic constraints.
Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015
Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets.
SIAM J. Optim., 2015

An alternating direction method with increasing penalty for stable principal component pursuit.
Comput. Optim. Appl., 2015

An ADMM Algorithm for Clustering Partially Observed Networks.
Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, April 30, 2015

An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
A unified approach for minimizing composite norms.
Math. Program., 2014

Efficient algorithms for robust and stable principal component pursuit problems.
Comput. Optim. Appl., 2014

A parallel method for large scale convex regression problems.
Proceedings of the 53rd IEEE Conference on Decision and Control, 2014

2012
A First-Order Augmented Lagrangian Method for Compressed Sensing.
SIAM J. Optim., 2012

2011
A First-Order Smoothed Penalty Method for Compressed Sensing.
SIAM J. Optim., 2011


  Loading...