Fast projection onto the simplex and the \(l_1\) ball
From MaRDI portal
Publication:304269
DOI10.1007/s10107-015-0946-6zbMath1347.49050OpenAlexW2180180824MaRDI QIDQ304269
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0946-6
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Numerical methods based on nonlinear programming (49M37)
Related Items (56)
Efficient projection algorithms onto the weighted \(\ell_1\) ball ⋮ Projections onto the canonical simplex with additional linear inequalities ⋮ A globally convergent method for solving a quartic generalized Markowitz portfolio problem ⋮ Unnamed Item ⋮ Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Sliced optimal transport on the sphere ⋮ Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball ⋮ Convergence rates of gradient methods for convex optimization in the space of measures ⋮ Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities ⋮ Unnamed Item ⋮ An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation ⋮ Optimal regularized hypothesis testing in statistical inverse problems ⋮ Screening Rules and its Complexity for Active Set Identification ⋮ Exact \(k\)-component graph learning for image clustering ⋮ A local MM subspace method for solving constrained variational problems in image recovery ⋮ On and Beyond Total Variation Regularization in Imaging: The Role of Space Variance ⋮ Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy ⋮ MF-OMO: An Optimization Formulation of Mean-Field Games ⋮ Convex histogram-based joint image segmentation with regularized optimal transport cost ⋮ Regularized non-local total variation and application in image restoration ⋮ Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices ⋮ Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares ⋮ Near-optimal discrete optimization for experimental design: a regret minimization approach ⋮ Total variation regularization for seismic waveform inversion using an adaptive primal dual hybrid gradient method ⋮ Towards off-the-grid algorithms for total variation regularized inverse problems ⋮ Inexact primal–dual gradient projection methods for nonlinear optimization on convex set ⋮ Unnamed Item ⋮ The distance between convex sets with Minkowski sum structure: application to collision detection ⋮ Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere ⋮ A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables ⋮ Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets ⋮ A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation ⋮ ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods ⋮ On Solving the Quadratic Shortest Path Problem ⋮ SSN: learning sparse switchable normalization via SparsestMax ⋮ Complexity of linear minimization and projection on some sets ⋮ A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs ⋮ A fast algorithm for solving linear inverse problems with uniform noise removal ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Simulation methods for robust risk assessment and the distorted mix approach ⋮ A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems ⋮ Efficient and Convergent Preconditioned ADMM for the Potts Models ⋮ Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient ⋮ Discrete Total Variation: New Definition and Minimization ⋮ Sparse regular variation ⋮ Portfolio Selection with Regularization ⋮ First-order methods for the convex hull membership problem
Uses Software
Cites Work
- Unnamed Item
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Time bounds for selection
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On Floyd and Rivest's SELECT algorithm
- Sparse and stable Markowitz portfolios
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Validation of subgradient optimization
- Total Variation Projection With First Order Schemes
This page was built for publication: Fast projection onto the simplex and the \(l_1\) ball
