Pages that link to "Item:Q1061617"
From MaRDI portal
The following pages link to A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617):
Displayed 18 items.
- 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)
- 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)
- 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)
- 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)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)