The following pages link to Alexandre d'Aspremont (Q340014):
Displaying 19 items.
- Phase retrieval for imaging problems (Q340015) (← links)
- Clustering and feature selection using sparse principal component analysis (Q374668) (← links)
- Support vector machine classification with indefinite kernels (Q1043851) (← links)
- Second order accurate distributed eigenvector computation for extremely large matrices (Q1952103) (← links)
- Quartic first-order methods for low-rank minimization (Q2031993) (← links)
- Restarting Frank-Wolfe: faster rates under Hölderian error bounds (Q2116603) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- Regularized nonlinear acceleration (Q2288185) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Nonlinear acceleration of momentum and primal-dual algorithms (Q2687048) (← links)
- (Q2810911) (← links)
- A Stochastic Smoothing Algorithm for Semidefinite Programming (Q2934474) (← links)
- Identifying small mean-reverting portfolios (Q3169214) (← links)
- Smooth Optimization with Approximate Gradient (Q3395010) (← links)
- Computational complexity versus statistical performance on sparse recovery problems (Q5006513) (← links)
- Weak Recovery Conditions from Graph Partitioning Bounds and Order Statistics (Q5169663) (← links)
- Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)
- Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes (Q6189906) (← links)
- Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems (Q6199283) (← links)
