A class of diagonal quasi-Newton methods for large-scale convex minimization
From MaRDI portal
Publication:503542
DOI10.1007/s40840-015-0117-1zbMath1357.65075OpenAlexW2059444119MaRDI QIDQ503542
Publication date: 13 January 2017
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: http://psasir.upm.edu.my/id/eprint/43466/1/abstract01.pdf
scalingquasi-Newton methodsdiagonal updatingnumerical resultglobal \(R\)-linear convergencelarge-scale convex minimization
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Methods of quasi-Newton type (90C53)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new two-step gradient-type method for large-scale unconstrained optimization
- An improved multi-step gradient-type method for large scale optimization
- A new gradient method via quasi-Cauchy relation which guarantees descent
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions
- Modified two-point stepsize gradient methods for unconstrained optimization
- Sizing and Least-Change Secant Methods
- Two-Point Step Size Gradient Methods
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Testing Unconstrained Optimization Software
- Self-Scaling Variable Metric (SSVM) Algorithms
- Line search algorithms with guaranteed sufficient decrease
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- The Quasi-Cauchy Relation and Diagonal Updating
- A Nonmonotone Line Search Technique for Newton’s Method
- Function minimization by conjugate gradients
