A limited memory BFGS method for solving large-scale symmetric nonlinear equations (Q1724803): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59040854, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Theory of Nonlinear Newton–Krylov Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new backtracking inexact BFGS method for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of truncated-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “global” convergence of Broyden-like methods with suitable line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BFGS algorithm for solving symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of quasi-Newton matrices and their use in limited memory methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited memory BFGS method with backtracking for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method with Descent Property for Symmetric Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3583407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BFGS trust-region method for symmetric nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BFGS trust-region method for nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive column correction algorithms for solving sparse nonlinear systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closed form solution of Troesch's problem / rank
 
Normal rank

Latest revision as of 05:27, 18 July 2024

scientific article
Language Label Description Also known as
English
A limited memory BFGS method for solving large-scale symmetric nonlinear equations
scientific article

    Statements

    A limited memory BFGS method for solving large-scale symmetric nonlinear equations (English)
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Summary: A limited memory BFGS (L-BFGS) algorithm is presented for solving large-scale symmetric nonlinear equations, where a line search technique without derivative information is used. The global convergence of the proposed algorithm is established under some suitable conditions. Numerical results show that the given method is competitive to those of the normal BFGS methods.
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers