Pages that link to "Item:Q304269"
From MaRDI portal
The following pages link to Fast projection onto the simplex and the \(l_1\) ball (Q304269):
Displayed 50 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)
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball (Q2191778) (← links)
- Exact \(k\)-component graph learning for image clustering (Q2196940) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- ACQUIRE: an inexact iteratively reweighted norm approach for TV-based Poisson image restoration (Q2284080) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A fast algorithm for solving linear inverse problems with uniform noise removal (Q2312004) (← links)
- Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices (Q2696695) (← links)
- Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares (Q2696927) (← links)
- Discrete Total Variation: New Definition and Minimization (Q3130746) (← links)
- Resonator Networks, 2: Factorization Performance and Capacity Compared to Optimization-Based Methods (Q3386436) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
- Total variation regularization for seismic waveform inversion using an adaptive primal dual hybrid gradient method (Q4638180) (← links)
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables (Q4687242) (← links)
- Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices (Q4967762) (← links)
- (Q4969074) (← links)
- Efficient and Convergent Preconditioned ADMM for the Potts Models (Q4997355) (← links)
- (Q4998892) (← links)
- Sparse regular variation (Q5013249) (← links)
- Screening Rules and its Complexity for Active Set Identification (Q5026418) (← links)
- Projections onto the canonical simplex with additional linear inequalities (Q5038426) (← links)
- (Q5053310) (← links)
- Inexact primal–dual gradient projection methods for nonlinear optimization on convex set (Q5151505) (← links)
- Portfolio Selection with Regularization (Q5865917) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists (Q6046287) (← links)
- Sliced optimal transport on the sphere (Q6070746) (← links)
- Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution (Q6071888) (← links)
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval (Q6079303) (← links)
- A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems (Q6097485) (← links)
- Convergence rates of gradient methods for convex optimization in the space of measures (Q6114893) (← links)
- Optimal analysis of method with batching for monotone stochastic finite-sum variational inequalities (Q6124397) (← links)
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation (Q6133674) (← links)
