On accelerating Newton's method based on a conic model (Q1118983): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4835588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conic Approximations and Collinear Scalings for Optimizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Gradient Methods less Dependent on Conjugacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>Q</i>-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization / rank
 
Normal rank

Latest revision as of 13:59, 19 June 2024

scientific article
Language Label Description Also known as
English
On accelerating Newton's method based on a conic model
scientific article

    Statements

    On accelerating Newton's method based on a conic model (English)
    0 references
    1989
    0 references
    For unconstrained minimization a method (not a numerical method) is discussed that utilizes a conic approximation model function given by \textit{W. C. Davidon} [SIAM J. Numer. Analysis 17, 268-281 (1980; Zbl 0424.65026)] and second-order derivative information in the same way that Newton's method. An accelerating of Newton's method is not proved.
    0 references
    unconstrained minimization
    0 references
    conic approximation
    0 references
    Newton's method
    0 references
    0 references
    0 references
    0 references

    Identifiers