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):

Displayed 9 items.

• 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)
• 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)