Home
Publications
Talks
Teaching
Contact
Light
Dark
Automatic
DC algorithm
Proximal Newton DC programming for non-convex problems
Newton-based method for solving non-convex optimization problems with sparsity constraints.
Sep 25, 2017 10:30 AM
Slides
Batch and online learning algorithms for nonconvex neyman-pearson classification
Gilles Gasso
,
Aristidis Pappaioannou
,
Marina Spivak
,
Leon Bottou
PDF
Cite
Cite
×