Fast projection onto the simplex and the \pmb l_\mathbf 1 l 1 ball

2015/09/19 by Laurent Condat · 21 citations
Computer Science · #Image and Signal Denoising Methods #Advanced Vision and Imaging #Computer Graphics and Visualization Techniques

paper · doi:10.1007/s10107-015-0946-6

Cited by

• Near-optimal discrete optimization for experimental design: a regret minimization approach
• Projected Gradient Methods with Momentum
• Online AUC Optimization for Sparse High-Dimensional Datasets
• Efficient Continuous Relaxations for Dense CRF
• Clustering with feature selection using alternating minimization, Application to computational biology
• Non-smooth Variable Projection
• Fast projection onto the top-k-sum constraint
• Fairness-aware PageRank via Edge Reweighting
• Robust supervised classification and feature selection using a primal-dual method
• Time series forecasting from partial observations via Non-negative Matrix Factorization
• PENDANTSS: PEnalized Norm-ratios Disentangling Additive Noise, Trend and Sparse Spikes
• Projections onto the canonical simplex with additional linear inequalities
• Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
• An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise
• Partial Policy Iteration for L1-Robust Markov Decision Processes
• Sorting out Lipschitz function approximation
• Fast and Simple Multiclass Data Segmentation: An Eigendecomposition and Projection-Free Approach
• The Optimal Smoothings of Sublinear Functions and Convex Cones
• Insense: Incoherent Sensor Selection for Sparse Signals
• A Proximal Approach for Sparse Multiclass SVM
• Sparse regular variation
• An Exact Solver for the Weston-Watkins SVM Subproblem