111
click to vote
MP
2016
10 years 26 days ago
2016
In this paper, we generalize the well-known Nesterov’s accelerated gradient (AG) method, originally designed for convex smooth optimization, to solve nonconvex and possibly stoch...
103
click to vote
MP
2016
10 years 26 days ago
2016
The perceptron algorithm is a simple iterative procedure for finding a point in a convex cone F. At each iteration, the algorithm only involves a query to a separation oracle for...
109
click to vote
MP
2016
10 years 26 days ago
2016
Abstract Hierarchies of semidefinite programs have been used to approximate or even solve polynomial programs. This approach rapidly becomes computationally expensive and is often...
104
click to vote
MP
2016
10 years 26 days ago
2016
A recurrent task in mathematical programming requires optimizing polytopes with prohibitivelymany constraints, e.g., the primal polytope in cutting-plane methods or the dual polyt...