11 citations · 46 across the 15 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.OC2013★ 1 cited
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
A. Patrascu, I. Necoara
In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and…
math.OC2013★ 2 cited
A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
Ion Necoara, Andrei Patrascu
In this paper we propose a variant of the random coordinate descent method for solving linearly constrained convex optimization problems with composite objective functions. If the…