A new supermemory gradient method for unconstrained optimization problems (Q1758038): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-011-0328-9 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: L-BFGS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
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-0328-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123676331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / 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: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of supermemory gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong global convergence of an adaptive nonmonotone memory gradient method / 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: Restart procedures for the conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new super-memory gradient method with curve search rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a memory gradient method without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new class of supermemory gradient methods / 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: Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convergence of subspace trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ODE-based trust region method for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limited memory BFGS method for large scale optimization / 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: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of nonmonotone stabilization trust region methods / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-011-0328-9 / rank
 
Normal rank

Latest revision as of 08:49, 11 December 2024

scientific article
Language Label Description Also known as
English
A new supermemory gradient method for unconstrained optimization problems
scientific article

    Statements

    A new supermemory gradient method for unconstrained optimization problems (English)
    0 references
    7 November 2012
    0 references
    unconstrained optimization
    0 references
    supermemory gradient method
    0 references
    trust region technique
    0 references
    ODE-based methods
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers