Pages that link to "Item:Q304269"

The following pages link to Fast projection onto the simplex and the \(l_1\) ball (Q304269):

Displaying 17 items.

• A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems (Q781111) (← links)
• Convex histogram-based joint image segmentation with regularized optimal transport cost (Q1703945) (← links)
• Regularized non-local total variation and application in image restoration (Q1703956) (← links)
• The distance between convex sets with Minkowski sum structure: application to collision detection (Q2023661) (← links)
• Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere (Q2025292) (← links)
• A multigrid algorithm for maxflow and min-cut problems with applications to multiphase image segmentation (Q2032045) (← links)
• Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
• SSN: learning sparse switchable normalization via SparsestMax (Q2056134) (← links)
• Complexity of linear minimization and projection on some sets (Q2060605) (← links)
• A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs (Q2063194) (← links)
• Efficient proximal mapping computation for low-rank inducing norms (Q2073049) (← links)
• Simulation methods for robust risk assessment and the distorted mix approach (Q2076947) (← links)
• Minimization over the \(\ell_1\)-ball using an active-set non-monotone projected gradient (Q2082555) (← links)
• First-order methods for the convex hull membership problem (Q2106714) (← links)
• Efficient projection algorithms onto the weighted \(\ell_1\) ball (Q2124458) (← links)
• A globally convergent method for solving a quartic generalized Markowitz portfolio problem (Q2143112) (← links)
• PD-ML-Lite: Private Distributed Machine Learning from Lightweight Cryptography (Q6488968) (← links)