Approximating Hessians in unconstrained optimization arising from discretized problems

V. Malmedy; Philippe Toint

doi:10.1007/s10589-010-9317-7

Approximating Hessians in unconstrained optimization arising from discretized problems

V. Malmedy, Philippe Toint

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

99 Téléchargements (Pure)

Résumé

We consider Hessian approximation schemes for large-scale unconstrained optimization in the context of discretized problems. The considered Hessians typically present a nontrivial sparsity and partial separability structure. This allows iterative quasi-Newton methods to solve them despite of their size. Structured finite-difference methods and updating schemes based on the secant equation are presented and compared numerically inside the multilevel trust-region algorithm proposed by Gratton et al. (IMA J. Numer. Anal. 28(4):827-861, 2008).

langue originale	Anglais
Pages (de - à)	1-22
Nombre de pages	22
journal	Computational Optimization and Applications
Volume	50
Numéro de publication	1
Les DOIs	https://doi.org/10.1007/s10589-010-9317-7
Etat de la publication	Publié - 1 sept. 2011

Accès au document

10.1007/s10589-010-9317-7

Technical Report 19-2008manuscrit soumis, 231 KB

Autres fichiers et liens

Link to publication in Scopus

1 Citations
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
123 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{204f09e180e54d27975f0cd1186a94e3,

title = "Approximating Hessians in unconstrained optimization arising from discretized problems",

abstract = "We consider Hessian approximation schemes for large-scale unconstrained optimization in the context of discretized problems. The considered Hessians typically present a nontrivial sparsity and partial separability structure. This allows iterative quasi-Newton methods to solve them despite of their size. Structured finite-difference methods and updating schemes based on the secant equation are presented and compared numerically inside the multilevel trust-region algorithm proposed by Gratton et al. (IMA J. Numer. Anal. 28(4):827-861, 2008).",

author = "V. Malmedy and Philippe Toint",

year = "2011",

month = sep,

day = "1",

doi = "10.1007/s10589-010-9317-7",

language = "English",

volume = "50",

pages = "1--22",

journal = "Computational Optimization and Applications",

issn = "0926-6003",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Approximating Hessians in unconstrained optimization arising from discretized problems

AU - Malmedy, V.

AU - Toint, Philippe

PY - 2011/9/1

Y1 - 2011/9/1

N2 - We consider Hessian approximation schemes for large-scale unconstrained optimization in the context of discretized problems. The considered Hessians typically present a nontrivial sparsity and partial separability structure. This allows iterative quasi-Newton methods to solve them despite of their size. Structured finite-difference methods and updating schemes based on the secant equation are presented and compared numerically inside the multilevel trust-region algorithm proposed by Gratton et al. (IMA J. Numer. Anal. 28(4):827-861, 2008).

AB - We consider Hessian approximation schemes for large-scale unconstrained optimization in the context of discretized problems. The considered Hessians typically present a nontrivial sparsity and partial separability structure. This allows iterative quasi-Newton methods to solve them despite of their size. Structured finite-difference methods and updating schemes based on the secant equation are presented and compared numerically inside the multilevel trust-region algorithm proposed by Gratton et al. (IMA J. Numer. Anal. 28(4):827-861, 2008).

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

U2 - 10.1007/s10589-010-9317-7

DO - 10.1007/s10589-010-9317-7

M3 - Article

AN - SCOPUS:79961006834

SN - 0926-6003

VL - 50

SP - 1

EP - 22

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

IS - 1

ER -

Approximating Hessians in unconstrained optimization arising from discretized problems

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