#### Filter Results:

- Full text PDF available (13)

#### Publication Year

2008

2018

- This year (1)
- Last 5 years (19)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

The stable principal component pursuit (SPCP) problem is a non-smooth convex optimization problem, the solution of which has been shown both in theory and in practice to enable one to recover the low… (More)

We propose a new first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min { ρ(x) + γ(x) : Ax− b ∈ K, x ∈ χ } , where ρ : Rn → R ∪ {+∞}, γ : Rn → R are closed,… (More)

- Necdet Serhat Aybat, Zenglei Wang, Tony R. Lin, Necdet Serhat Aybat
- IEEE Transactions on Automatic Control
- 2018

Given an undirected graph <inline-formula><tex-math notation="LaTeX">$\mathcal {G}=(\mathcal {N},\mathcal {E})$ </tex-math></inline-formula> of agents <inline-formula><tex-math… (More)

- Necdet Serhat Aybat, Garud Iyengar
- Comp. Opt. and Appl.
- 2015

The stable principal component pursuit (SPCP) is a non-smooth convex optimization problem, the solution of which enables one to reliably recover the low rank and sparse components of a data matrix… (More)

- Necdet Serhat Aybat, Garud Iyengar
- SIAM Journal on Optimization
- 2011

We propose a first-order smoothed penalty algorithm (SPA) to solve the sparse recovery problem min{‖x‖1 : Ax = b}. SPA is efficient as long as the matrix-vector product Ax and AT y can be computed… (More)

We consider cooperative multi-agent resource sharing problems over time-varying communication networks, where only local communications are allowed. The objective is to minimize the sum of… (More)

- Necdet Serhat Aybat, Garud Iyengar
- Math. Program.
- 2014

We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem minX∈Rm×n μ1‖σ(F(X)−G)‖α + μ2‖C(X)− d‖β , subject to A(X)− b ∈ Q, where σ(X) denotes… (More)

- Necdet Serhat Aybat, Garud Iyengar
- SIAM Journal on Optimization
- 2012

In this paper, we propose a first-order augmented Lagrangian algorithm (FAL) that solves the basis pursuit problem min{‖x‖1 : Ax = b} by inexactly solving a sequence of problems of the form minx∈<n {… (More)

- Necdet Serhat Aybat, Zi Wang, Garud Iyengar
- ICML
- 2015

We propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a… (More)

- A. M. Jasour, Necdet Serhat Aybat, Constantino M. Lagoa
- SIAM Journal on Optimization
- 2015

In this paper, “chance optimization” problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and… (More)