The University of Southampton
University of Southampton Institutional Repository

Adaptive matrix algebras in unconstrained minimization

Adaptive matrix algebras in unconstrained minimization
Adaptive matrix algebras in unconstrained minimization

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.

Iterative procedures, Matrix algebras, Quasi-Newton methods, Unconstrained minimization
0024-3795
544-568
Cipolla, S.
373fdd4b-520f-485c-b36d-f75ce33d4e05
Di Fiore, C.
f43c7f86-7a2e-474a-ad41-3ff3797128bc
Tudisco, F.
3c9b5744-c949-402e-ad23-b9f053c62e37
Zellini, P.
ba2b701f-50cd-4b28-a91f-5bcd86484960
Cipolla, S.
373fdd4b-520f-485c-b36d-f75ce33d4e05
Di Fiore, C.
f43c7f86-7a2e-474a-ad41-3ff3797128bc
Tudisco, F.
3c9b5744-c949-402e-ad23-b9f053c62e37
Zellini, P.
ba2b701f-50cd-4b28-a91f-5bcd86484960

Cipolla, S., Di Fiore, C., Tudisco, F. and Zellini, P. (2015) Adaptive matrix algebras in unconstrained minimization. Linear Algebra and Its Applications, 471, 544-568. (doi:10.1016/j.laa.2015.01.010).

Record type: Article

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.

This record has no associated files available for download.

More information

Published date: 15 April 2015
Additional Information: Publisher Copyright: © 2015 Elsevier Inc. All rights reserved.
Keywords: Iterative procedures, Matrix algebras, Quasi-Newton methods, Unconstrained minimization

Identifiers

Local EPrints ID: 485621
URI: http://eprints.soton.ac.uk/id/eprint/485621
ISSN: 0024-3795
PURE UUID: 41a2866f-fac2-4855-808d-05525c9f58ce
ORCID for S. Cipolla: ORCID iD orcid.org/0000-0002-8000-4719

Catalogue record

Date deposited: 12 Dec 2023 17:34
Last modified: 18 Mar 2024 04:17

Export record

Altmetrics

Contributors

Author: S. Cipolla ORCID iD
Author: C. Di Fiore
Author: F. Tudisco
Author: P. Zellini

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×