Two limited-memory optimization methods with minimum violation of the previous secant conditions (Q2057221): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CUTE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LSA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UFO / 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/s10589-021-00318-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3200672889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / 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: Least Change Secant Updates for Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified BFGS method and its global convergence in nonconvex minimization / 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: Algorithm 896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3057247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric methods for unconstrained optimization and nonlinear least squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating Quasi-Newton Matrices with Limited Storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjugate directions approach to improve the limited-memory BFGS method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global convergence of a modified BFGS method for nonconvex functions / rank
 
Normal rank

Latest revision as of 10:36, 27 July 2024

scientific article
Language Label Description Also known as
English
Two limited-memory optimization methods with minimum violation of the previous secant conditions
scientific article

    Statements

    Two limited-memory optimization methods with minimum violation of the previous secant conditions (English)
    0 references
    8 December 2021
    0 references
    unconstrained minimization
    0 references
    variable metric methods
    0 references
    limited-memory methods
    0 references
    variationally derived methods
    0 references
    global convergence
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers