A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Variable Metric Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems / 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: Q5287741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4107408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The BFGS method with exact line searches fails for non-convex objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence properties of the modified BFGS method associating with general line search model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4330109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ABS algorithm for solving singular nonlinear systems with rank defects. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric methods of minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of functions having Lipschitz continuous first partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective algorithm for minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Conditions for Ascent Methods / rank
 
Normal rank

Revision as of 18:38, 28 June 2024

scientific article
Language Label Description Also known as
English
A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
scientific article

    Statements

    A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (English)
    0 references
    0 references
    0 references
    0 references
    21 October 2008
    0 references
    The authors make efforts to establish a new algorithm for solving unconstrained optimization problems. It bases on the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method with a suitable line-search. It differs from the standard approach by making use of an auxiliary function which has the same global minimum as the objective function -- more precisely it depends on the minimizer. A global convergence analysis is carried out and shows a super-linear convergence. However, it remains obscure how an implementation could look like and the English is dissatisfying.
    0 references
    unconstrained optimization
    0 references
    modified BFGS
    0 references
    line search
    0 references
    global convergence
    0 references
    Broyden-Fletcher-Goldfarb-Shanno (BFGS) method
    0 references
    super-linear convergence
    0 references

    Identifiers