scientific article; zbMATH DE number 3812857

MaRDI QIDQ3660804zbMATH OpenFDO

Authors Ladislav Lukšan

Publication date 1982

Full work available at URL https://eudml.org/doc/28010

zbMATH Keywords

best quasi-Newton methodsconjugate gradientslarge-scale unconstrained minimizationlimited memorylimited storagenumerical experimentsvariable metric method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A combined conjugate-gradient quasi-Newton minimization algorithm
• A conjugate direction algorithm without line searches
• A Family of Variable-Metric Methods Derived by Variational Means
• A new approach to variable metric algorithms
• A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
• Conditioning of Quasi-Newton Methods for Function Minimization
• Conjugate Gradient Methods with Inexact Searches
• Extending the relationship between the conjugate gradient and BFGS algorithms
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 3439906 (Why is no real title available?)
• Matrix conditioning and nonlinear optimization
• Methods of conjugate gradients for solving linear systems
• Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
• Restart procedures for the conjugate gradient method
• Self-Scaling Variable Metric (SSVM) Algorithms
• Some Algorithms for Minimizing a Function of Several Variables
• Technical Note—A Modified Conjugate Gradient Algorithm
• The Convergence of a Class of Double-rank Minimization Algorithms
• Updating Quasi-Newton Matrices with Limited Storage

Describes a project that uses

Uses Software

• L-BFGS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3660804)