Low‐complexity minimization algorithms
From MaRDI portal
Recommendations
- New quasi-Newton methods for unconstrained optimization problems
- Convergence of quasi-Newton matrices with modified symmetric rank 1 updates
- Matrix algebras in quasi-Newton methods for unconstrained minimization
- Modified quasi-Newton methods for solving systems of linear equations
- A quasi-Newton method with sparse triple factorization for unconstrained minimization
- scientific article; zbMATH DE number 2195345
- Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- An algorithm for unconstrained optimization
- Numerical experiments with variations of the Gauss-Newton algorithm for nonlinear least squares
Cites work
Cited in
(6)- A variation of Broyden class methods using Householder adaptive transforms
- Adaptive matrix algebras in unconstrained minimization
- Low complexity matrix projections preserving actions on vectors
- Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
- Gradient-type methods: a unified perspective in computer science and numerical analysis
- A new algorithm for box-constrained global optimization
This page was built for publication: Low‐complexity minimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599999)