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

Research output: Contribution to journal › Article › peer-review

95 Downloads (Pure)

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. © Springer Science+Business Media, LLC 2011.

Original language	English
Pages (from-to)	967-979
Number of pages	13
Journal	Computational Optimization and Applications
Volume	51
Issue number	3
DOIs	https://doi.org/10.1007/s10589-011-9393-3
Publication status	Published - 1 Apr 2012

Keywords

nonlinear conjugate gradient methods
nonlinear optimization
quasi-Newton methods
multilevel problems
limited-memory algorithms

Access to Document

10.1007/s10589-011-9393-3

Technical Report 18-2009Submitted manuscript, 269 KB

Fingerprint Dive into the research topics of 'Using approximate secant equations in limited memory methods for multilevel unconstrained optimization'. Together they form a unique fingerprint.

1 Finished
1 Active

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization
SARTENAER, A. & TOINT, P.
1/01/87 → …
Project: Research Axis
Multiscale nonlinear optimization
SARTENAER, A., TOINT, P., Malmedy, V., Tomanos, D. & Weber Mendonca, M.
1/07/04 → 31/07/11
Project: Research

Cite this

@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",

issn = "0926-6003",

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

SN - 0926-6003

IS - 3

ER -

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

Abstract

Keywords

Access to Document

Other files and links

ADALGOPT: ADALGOPT - Advanced algorithms in nonlinear optimization

Multiscale nonlinear optimization

Cite this