Pages that link to "Item:Q1061617"

The following pages link to A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617):

Displaying 50 items.

• Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
• Estimation of low rank density matrices: bounds in Schatten norms and other distances (Q315410) (← links)
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• Two fast algorithms for projecting a point onto the canonical simplex (Q327053) (← links)
• Distance majorization and its applications (Q403660) (← links)
• PAMR: passive aggressive mean reversion strategy for portfolio selection (Q420935) (← links)
• Augmented Lagrangian method for total variation based image restoration and segmentation over triangulated surfaces (Q421313) (← links)
• Objective Bayesian analysis for the normal compositional model (Q434916) (← links)
• A fast procedure for calculating importance weights in bootstrap sampling (Q452522) (← links)
• Strong semismoothness of projection onto slices of second-order cone (Q650214) (← links)
• Portfolio management without probabilities or statistics (Q666453) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• On the continuous quadratic knapsack problem (Q1194858) (← links)
• An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) (← links)
• A residual algorithm for finding a fixed point of a nonexpansive mapping (Q1615317) (← links)
• Midrange geometric interactions for semantic segmentation. Constraints for continuous multi-label optimization (Q1800049) (← links)
• Geometrically convergent projection method in matrix games (Q1897450) (← links)
• A first-order primal-dual algorithm for convex problems with applications to imaging (Q1932848) (← links)
• Fast projections onto mixed-norm balls with applications (Q1944995) (← links)
• A purely geometric approach to the problem of computing the projection of a point on a simplex (Q1949586) (← links)
• Single-forward-step projective splitting: exploiting cocoercivity (Q2026768) (← links)
• A fast and efficient smoothing approach to Lasso regression and an application in statistical genetics: polygenic risk scores for chronic obstructive pulmonary disease (COPD) (Q2058755) (← links)
• Efficient projection algorithms onto the weighted \(\ell_1\) ball (Q2124458) (← links)
• A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball (Q2191778) (← links)
• Distance to the stochastic part of phylogenetic varieties (Q2229740) (← links)
• Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model (Q2251265) (← links)
• A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model (Q2254247) (← links)
• Finding flow equilibrium with projective methods with decomposition and route generation (Q2261748) (← links)
• Semisupervised data classification via the Mumford-Shah-Potts-type model (Q2294163) (← links)
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
• On the convergence of inexact block coordinate descent methods for constrained optimization (Q2356093) (← links)
• Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
• Minimization of convex functions on the convex hull of a point set (Q2433235) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• A path-based double projection method for solving the asymmetric traffic network equilibrium problem (Q2458917) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
• A projected gradient method for optimization over density matrices (Q2815508) (← links)
• Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866) (← links)
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
• Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
• Active Mean Fields for Probabilistic Image Segmentation: Connections with Chan--Vese and Rudin--Osher--Fatemi Models (Q4602179) (← links)
• Screening Rules and its Complexity for Active Set Identification (Q5026418) (← links)
• Projections onto the canonical simplex with additional linear inequalities (Q5038426) (← links)
• Inexact primal–dual gradient projection methods for nonlinear optimization on convex set (Q5151505) (← links)
• A Computational Framework for Multivariate Convex Regression and Its Variants (Q5229914) (← links)
• An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
• Efficient Nonnegative Matrix Factorization by DC Programming and DCA (Q5380443) (← links)
• (Q5381134) (← links)