Multi-step quasi-Newton methods for optimization (Q1334773): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 500 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(94)90309-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054094588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Krawczyk-Like Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Methods for Solving Nonlinear Simultaneous Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversionsfreie Verfahren zur Lösung nichtlinearer Operatorgleichungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjugate direction implementation of the BFGS algorithm with automatic scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Secant Updates of Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of function-values in unconstrained optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of curvature estimates in quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of minimization methods of quasi-Newton type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods for Discretized Non-linear Boundary Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of highly structured nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quasi-Newton Method Employing Direct Secant Updates of Matrix Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4] / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Large Scale Nonlinear Least Squares Calculations / rank
 
Normal rank

Latest revision as of 17:01, 22 May 2024

scientific article
Language Label Description Also known as
English
Multi-step quasi-Newton methods for optimization
scientific article

    Statements

    Multi-step quasi-Newton methods for optimization (English)
    0 references
    0 references
    0 references
    22 September 1994
    0 references
    Quasi-Newton methods update the existing Hessian approximation by means of data derived from the step just completed. The authors propose ``multistep'' methods, employing data from previous iterations, by means of interpolating polynomials. The results of extensive numerical experimentation indicate strongly that computational advantages can occur from such an approach, particularly as the dimension of the problem increases.
    0 references
    0 references
    multistep quasi-Newton methods
    0 references
    unconstrained optimization
    0 references
    numerical experimentation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers