A fast and robust unconstrained optimization method requiring minimum storage
From MaRDI portal
Recommendations
- Publication:3477903
- A compact limited memory method for large scale unconstrained optimization
- An efficient algorithm for unconstrained optimization
- A Rapid Method for Optimization of Linear Systems with Storage
- scientific article; zbMATH DE number 5066295
- scientific article; zbMATH DE number 1424368
- A new method for solving unconstrained optimization problems
- Rapidly convergent Steffensen-based methods for unconstrained optimization
- Accelerated multiple step-size methods for solving unconstrained optimization problems
- A new efficient conjugate gradient method for unconstrained optimization
Cites work
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- A new approach to variable metric algorithms
- A Note on Minimization Algorithms which make Use of Non-quardratic Properties of the Objective Function
- A Rapidly Convergent Descent Method for Minimization
- An assessment of two approaches to variable metric methods
- Conjugate Gradient Methods with Inexact Searches
- Function minimization by conjugate gradients
- scientific article; zbMATH DE number 3873094 (Why is no real title available?)
- scientific article; zbMATH DE number 3476911 (Why is no real title available?)
- scientific article; zbMATH DE number 3535837 (Why is no real title available?)
- scientific article; zbMATH DE number 3604274 (Why is no real title available?)
- scientific article; zbMATH DE number 3617919 (Why is no real title available?)
- scientific article; zbMATH DE number 3382096 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- scientific article; zbMATH DE number 3423824 (Why is no real title available?)
- Linear Convergence of the Conjugate Gradient Method
- Matrix conditioning and nonlinear optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Optimally conditioned optimization algorithms without line searches
- Restart procedures for the conjugate gradient method
- Technical Note—A Modified Conjugate Gradient Algorithm
Cited in
(12)- A conjugate direction gradient method with reconnaissance steps for unconstrained minimization
- A convergent dynamic method for large minimization problems
- An algorithm for solving sparse nonlinear least squares problems
- Vectorization of conjugate-gradient methods for large-scale minimization in meteorology
- New computational results on some methods with Fortran in optimization
- scientific article; zbMATH DE number 4147424 (Why is no real title available?)
- UNCONSTRAINED MINIMIZATION BY COMBINING THE DYNAMIC AND CONJUGATE GRADIENT METHODS
- scientific article; zbMATH DE number 179183 (Why is no real title available?)
- A conjugate gradient method with quasi-Newton approximation
- scientific article; zbMATH DE number 1889337 (Why is no real title available?)
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
This page was built for publication: A fast and robust unconstrained optimization method requiring minimum storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3693274)
