Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm (Q1232140): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1424603
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Michael R. Osborne / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete, linear approximation problems in polyhedral norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete, non-linear approximation problems in polyhedral norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for the solution of certain non-linear problems in least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear least squares — the Levenberg algorithm revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603731 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094457339 / rank
 
Normal rank

Latest revision as of 08:32, 30 July 2024

scientific article
Language Label Description Also known as
English
Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
scientific article

    Statements

    Identifiers

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