A descent algorithm without line search for unconstrained optimization (Q1044422): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.amc.2009.08.058 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071162569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization theory and methods. Nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of descent method without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate Directions without Linear Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternate minimization gradient method / 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: R-linear convergence of the Barzilai and Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive two-point stepsize gradient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization algorithms based on supervisor and searcher cooperation / 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: On the Barzilai and Borwein choice of steplength for the gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of gradient unconstrained minimization algorithms with adaptive stepsize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3477903 / 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: Gradient Method with Retards and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of the optimal constants and the thickness of thin films using unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a two-parameter family of conjugate gradient methods without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of conjugate gradient methods without line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of line search methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new descent algorithm with curve search rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank

Latest revision as of 08:10, 2 July 2024

scientific article
Language Label Description Also known as
English
A descent algorithm without line search for unconstrained optimization
scientific article

    Statements

    A descent algorithm without line search for unconstrained optimization (English)
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    unconstrained optimization
    0 references
    descent method
    0 references
    line search
    0 references
    convergence
    0 references
    numerical result
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references