Abstract
In this paper we study adaptive L(k)QN methods, involving special matrix algebras of low complexity, to solve general (non-structured) unconstrained minimization problems. These methods, which generalize the classical BFGS method, are based on an iterative formula which exploits, at each step, an ad hoc chosen matrix algebra L(k). A global convergence result is obtained under suitable assumptions on f.
| Original language | English |
|---|---|
| Pages (from-to) | 544-568 |
| Number of pages | 25 |
| Journal | Linear Algebra and its Applications |
| Volume | 471 |
| DOIs | |
| Publication status | Published - 30 Jan 2015 |
Keywords
- unconstrained minimisation
- unconstrained minimization
- quasi-Newton BFGS method
- matrix algebras
- iterative algorithm
- convergence
Fingerprint
Dive into the research topics of 'Adaptive matrix algebras in unconstrained minimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver