Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3724086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5249476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithm for projecting a point on a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two fast algorithms for projecting a point onto the canonical simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the distance between ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A purely geometric approach to the problem of computing the projection of a point on a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalty functions in isoperimetric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods in the Parametric Moving Boundary Variational Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Method of Steepest Descent for Two-Dimensional Problems of Calculus of Variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomially bounded algorithm for a singly constrained quadratic program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank

Latest revision as of 10:07, 12 July 2024

scientific article
Language Label Description Also known as
English
Comparative study of two fast algorithms for projecting a point to the standard simplex
scientific article

    Statements

    Comparative study of two fast algorithms for projecting a point to the standard simplex (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2016
    0 references
    quadratic programming
    0 references
    projecting a point to a simplex
    0 references
    optimality conditions
    0 references

    Identifiers