An algorithm for computing nonnegative minimal norm solutions (Q4291888): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of subgradient projection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-subgradient projection algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for non-negative norm minimal solutions / rank
 
Normal rank

Latest revision as of 15:50, 22 May 2024

scientific article; zbMATH DE number 567650
Language Label Description Also known as
English
An algorithm for computing nonnegative minimal norm solutions
scientific article; zbMATH DE number 567650

    Statements

    An algorithm for computing nonnegative minimal norm solutions (English)
    0 references
    0 references
    0 references
    22 June 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    duality
    0 references
    numerical experiments
    0 references
    algorithm
    0 references
    nonnegative, minimal norm solution
    0 references
    quadratic programming problem
    0 references
    global convergence
    0 references
    0 references