A new variant of the memory gradient method for unconstrained optimization (Q1926613): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s11590-011-0355-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102823641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: The conjugate gradient method in extremal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of the Fletcher-Reeves method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of Algorithms for Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent version of the Polak-Ribière conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence result for conjugate gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermemory descent methods for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3626416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2720792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On memory gradient method with trust region for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation between the memory gradient method and the Fletcher-Reeves method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new supermemory gradient method for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a memory gradient 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: Q3539529 / rank
 
Normal rank

Latest revision as of 01:21, 6 July 2024

scientific article
Language Label Description Also known as
English
A new variant of the memory gradient method for unconstrained optimization
scientific article

    Statements

    A new variant of the memory gradient method for unconstrained optimization (English)
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    0 references
    unconstrained optimization
    0 references
    memory gradient method
    0 references
    line search
    0 references
    global convergence
    0 references
    convergence rate
    0 references
    0 references