A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (Q2475129): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A nonmonotone conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonmonotone line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic trust region algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new unconstrained optimization algorithms which use function and gradient values / 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: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergece of the bfgs algorithm with nonmonotone linesearch<sup>∗</sup><sup>∗</sup>this work is supported by national natural science foundation$ef: / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone trust region method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 'taut string algorithm' for straightening a piecewise linear path in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global convergence of trust region algorithms for unconstrained minimization / 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: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone trust region method for solving optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of nonmonotone descent methods for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4538036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone adaptive trust region method and its convergence / rank
 
Normal rank

Latest revision as of 18:45, 27 June 2024

scientific article
Language Label Description Also known as
English
A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
scientific article

    Statements

    A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2008
    0 references
    The authors develop a new nonmonotone trust region method for the numerical solution of smooth unconstrained optimization problems, by combining the method proposed by \textit{H. Zhang} and \textit{W. W. Hager} [SIAM J. Optim. 14, No. 4, 1043--1056 (2004; Zbl 1073.90024)] with the trust region method. Under certain appropriate assumptions, the global convergence and also the superlinear convergence of the proposed algorithm is established. Its efficiency is then tested by numerical experiments.
    0 references
    0 references
    0 references
    0 references
    0 references
    smooth unconstrained optimization
    0 references
    nonmonotone line search
    0 references
    nonmonotone trust region method
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    algorithm
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references