An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities (Q4707313): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A least distance algorithm for a smooth strictly convex norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3319163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing nonnegative minimal norm solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003022 / 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: An algorithm for non-negative norm minimal solutions / rank
 
Normal rank

Latest revision as of 17:32, 5 June 2024

scientific article; zbMATH DE number 1925745
Language Label Description Also known as
English
An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities
scientific article; zbMATH DE number 1925745

    Statements

    An Algorithm For A Minimum Norm Solution Of A System Of Linear Inequalities (English)
    0 references
    0 references
    0 references
    19 March 2004
    0 references
    system of linear equations
    0 references
    least distance algorithm
    0 references
    system of linear inequalities
    0 references
    numerical examples
    0 references
    convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references