Diagonal approximation of the Hessian by finite differences for unconstrained optimization
From MaRDI portal
Recommendations
- A new diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A diagonal quasi-Newton updating method for unconstrained optimization
- scientific article; zbMATH DE number 1193038
- A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 6270804 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A diagonal quasi-Newton updating method for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- Benchmarking optimization software with performance profiles.
- CUTE
- Continuous nonlinear optimization for engineering applications in GAMS technology
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Improved Hessian approximation with modified quasi-Cauchy relation for gradient-type method
- Inaccuracy in quasi-Newton methods: Local improvement theorems
- Linear and nonlinear programming
- Nonlinear optimization with engineering applications
- On the limited memory BFGS method for large scale optimization
- Preconditioning of Truncated-Newton Methods
- Quasi-Newton Methods, Motivation and Theory
- Sizing and Least-Change Secant Methods
- Some numerical experiments with variable-storage quasi-Newton algorithms
- The Effect of Rounding Errors on Newton-like Methods
- The Newton-Cauchy framework. A unified approach to unconstrained nonlinear minimization
- The Quasi-Cauchy Relation and Diagonal Updating
Cited in
(13)- Second-order design sensitivity analysis using diagonal hyper-dual numbers
- A class of accelerated subspace minimization conjugate gradient methods
- A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM
- A new diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- A diagonal quasi-Newton method based on automatic differentiation for nonlinear equations
- Diagonal Hessian approximation for limited memory quasi-Newton via variational principle
- scientific article; zbMATH DE number 1193038 (Why is no real title available?)
- Accelerated nonlinear finite element method for analysis of isotropic hyperelastic materials nonlinear deformations
- Approximating Hessians in unconstrained optimization arising from discretized problems
- Combined methods for solving degenerate unconstrained optimization problems
- A new version of augmented self-scaling BFGS method
- A new accelerated diagonal quasi-Newton updating method with scaled forward finite differences directional derivative for unconstrained optimization
- Approximating the diagonal of a Hessian: which sample set of points should be used
This page was built for publication: Diagonal approximation of the Hessian by finite differences for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188948)
