A class of diagonal quasi-Newton methods for large-scale convex minimization (Q503542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical expirience with a class of self-scaling quasi-Newton algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / 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: Modified two-point stepsize gradient methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sizing and Least-Change Secant Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new two-step gradient-type method for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved multi-step gradient-type method for large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new gradient method via quasi-Cauchy relation which guarantees descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line search algorithms with guaranteed sufficient decrease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaling Variable Metric (SSVM) Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4107408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quasi-Cauchy Relation and Diagonal Updating / rank
 
Normal rank

Revision as of 06:46, 13 July 2024

scientific article
Language Label Description Also known as
English
A class of diagonal quasi-Newton methods for large-scale convex minimization
scientific article

    Statements

    A class of diagonal quasi-Newton methods for large-scale convex minimization (English)
    0 references
    0 references
    13 January 2017
    0 references
    This paper considers the diagonal quasi-Newton method with the Zhu-Nazareth-Wolkowicz updating formula in minimizing a smooth function. The author shows that the scaled method with the Wolfe's line search is globally and linearly convergent on uniformly convex objective functions. Some numerical results on solving a set of 32 test problems are presented.
    0 references
    large-scale convex minimization
    0 references
    quasi-Newton methods
    0 references
    diagonal updating
    0 references
    scaling
    0 references
    global \(R\)-linear convergence
    0 references
    numerical result
    0 references

    Identifiers

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