Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

Serge Gratton; Vincent Malmedy; Philippe Toint

doi:10.1007/s10589-011-9393-3

Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

Serge Gratton, Vincent Malmedy, Philippe Toint

Résultats de recherche: Contribution à un journal/une revue › Article › Revue par des pairs

108 Téléchargements (Pure)

Résumé

The properties of multilevel optimization problems defined on a hierarchy of discretization grids can be used to define approximate secant equations, which describe the second-order behavior of the objective function. Following earlier work by Gratton and Toint (2009) we introduce a quasi-Newton method (with a linesearch) and a nonlinear conjugate gradient method that both take advantage of this new second-order information. We then present numerical experiments with these methods and formulate recommendations for their practical use. © Springer Science+Business Media, LLC 2011.

langue originale	Anglais
Pages (de - à)	967-979
Nombre de pages	13
journal	Computational Optimization and Applications
Volume	51
Numéro de publication	3
Les DOIs	https://doi.org/10.1007/s10589-011-9393-3
Etat de la publication	Publié - 1 avr. 2012

Accès au document

10.1007/s10589-011-9393-3

Technical Report 18-2009manuscrit soumis, 269 KB

Autres fichiers et liens

Link to publication in Scopus

1 Article

Quasi-Newton updates with weighted secant equations
Gratton, S., Malmedy, V. & Toint, P., 4 juil. 2015, Dans: Optimization Methods and Software. 30, 4, p. 748-755 8 p.
Résultats de recherche: Contribution à un journal/une revue › Article › Revue par des pairs

File
135 Téléchargements (Pure)

1 Terminé
1 Actif

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
Sartenaer, A. & Toint, P.
1/01/87 → …
Projet: Axe de recherche
Optimisation multi-échelle non-linéaire
Sartenaer, A., Toint, P., Malmedy, V., Tomanos, D. & Weber Mendonca, M.
1/07/04 → 31/07/11
Projet: Recherche

Contient cette citation

@article{9b6209cc259248218f4210fef2b6a227,

title = "Using approximate secant equations in limited memory methods for multilevel unconstrained optimization",

abstract = "The properties of multilevel optimization problems defined on a hierarchy of discretization grids can be used to define approximate secant equations, which describe the second-order behavior of the objective function. Following earlier work by Gratton and Toint (2009) we introduce a quasi-Newton method (with a linesearch) and a nonlinear conjugate gradient method that both take advantage of this new second-order information. We then present numerical experiments with these methods and formulate recommendations for their practical use. {\textcopyright} Springer Science+Business Media, LLC 2011.",

keywords = " nonlinear conjugate gradient methods, nonlinear optimization, quasi-Newton methods, multilevel problems, limited-memory algorithms",

author = "Serge Gratton and Vincent Malmedy and Philippe Toint",

year = "2012",

month = apr,

day = "1",

doi = "10.1007/s10589-011-9393-3",

language = "English",

volume = "51",

pages = "967--979",

journal = "Computational Optimization and Applications",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

AU - Gratton, Serge

AU - Malmedy, Vincent

AU - Toint, Philippe

PY - 2012/4/1

Y1 - 2012/4/1

N2 - The properties of multilevel optimization problems defined on a hierarchy of discretization grids can be used to define approximate secant equations, which describe the second-order behavior of the objective function. Following earlier work by Gratton and Toint (2009) we introduce a quasi-Newton method (with a linesearch) and a nonlinear conjugate gradient method that both take advantage of this new second-order information. We then present numerical experiments with these methods and formulate recommendations for their practical use. © Springer Science+Business Media, LLC 2011.

AB - The properties of multilevel optimization problems defined on a hierarchy of discretization grids can be used to define approximate secant equations, which describe the second-order behavior of the objective function. Following earlier work by Gratton and Toint (2009) we introduce a quasi-Newton method (with a linesearch) and a nonlinear conjugate gradient method that both take advantage of this new second-order information. We then present numerical experiments with these methods and formulate recommendations for their practical use. © Springer Science+Business Media, LLC 2011.

KW - nonlinear conjugate gradient methods

KW - nonlinear optimization

KW - quasi-Newton methods

KW - multilevel problems

KW - limited-memory algorithms

UR - http://www.scopus.com/inward/record.url?scp=84861999218&partnerID=8YFLogxK

U2 - 10.1007/s10589-011-9393-3

DO - 10.1007/s10589-011-9393-3

M3 - Article

VL - 51

SP - 967

EP - 979

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

IS - 3

ER -

Using approximate secant equations in limited memory methods for multilevel unconstrained optimization

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Résultat de recherche

Quasi-Newton updates with weighted secant equations

Projets

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire

Optimisation multi-échelle non-linéaire

Contient cette citation