The following pages link to Necdet Serhat Aybat (Q2280909):
Displayed 29 items.
- A fully distributed traffic allocation algorithm for nonconcave utility maximization in connectionless communication networks (Q2280910) (← links)
- Efficient algorithms for robust and stable principal component pursuit problems (Q2450901) (← links)
- Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization (Q4567042) (← links)
- Generalized Sparse Precision Matrix Selection for Fitting Multivariate Gaussian Random Fields to Large Data Sets (Q4639586) (← links)
- A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems (Q4989936) (← links)
- On the Analysis of Inexact Augmented Lagrangian Schemes for Misspecified Conic Convex Programs (Q5040073) (← links)
- (Q5149246) (← links)
- A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks (Q5206938) (← links)
- Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets (Q5501233) (← links)
- Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions (Q5853717) (← links)
- A Decentralized Primal-Dual Method for Constrained Minimization of a Strongly Convex Function (Q6077139) (← links)
- Robust Accelerated Primal-Dual Methods for Computing Saddle Points (Q6130545) (← links)
- Fast First-Order Methods for Stable Principal Component Pursuit (Q6225330) (← links)
- An Augmented Lagrangian Method for Conic Convex Programming (Q6239902) (← links)
- A Parallel Method for Large Scale Convex Regression Problems (Q6253474) (← links)
- An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization (Q6255080) (← links)
- An ADMM Algorithm for Clustering Partially Observed Networks (Q6255501) (← links)
- On the rate analysis of inexact augmented Lagrangian schemes for convex optimization problems with misspecified constraints (Q6266038) (← links)
- A primal-dual method for conic constrained distributed optimization problems (Q6275399) (← links)
- On the analysis of inexact augmented Lagrangian schemes for misspecified conic convex programs (Q6276272) (← links)
- A Parallelizable Dual Smoothing Method for Large Scale Convex Regression Problems (Q6276298) (← links)
- Non-Concave Network Utility Maximization in Connectionless Networks: A Fully Distributed Traffic Allocation Algorithm (Q6283697) (← links)
- Multi-agent constrained optimization of a strongly convex function over time-varying directed networks (Q6288241) (← links)
- Decentralized Computation of Effective Resistances and Acceleration of Consensus Algorithms (Q6290449) (← links)
- Randomized Primal-Dual Methods with Adaptive Step Sizes (Q6302872) (← links)
- A Doubly-Randomized Block-Coordinate Primal-Dual Method for Large-scale Saddle Point Problems (Q6321761) (← links)
- Randomized Gossiping with Effective Resistance Weights: Performance Guarantees and Applications (Q6322905) (← links)
- SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems (Q6400555) (← links)
- High Probability and Risk-Averse Guarantees for a Stochastic Accelerated Primal-Dual Method (Q6431722) (← links)