Professional Documents
Culture Documents
Abstract
Abstract
net/publication/353452025
CITATIONS READS
0 43
3 authors:
Joris Degroote
Ghent University
258 PUBLICATIONS 4,463 CITATIONS
SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Analytical Study of Multi-secant Quasi-Newton Methods for Optimization Problems View project
All content following this page was uploaded by Rob Haelterman on 16 November 2021.
Solving complex root-finding problems is now a common situation in engineering. In most industrial
applications, numerical methods helped to develop pieces of software that can simply be considered
as a black box solving a problem based on given input variables. When such a black box is available,
optimization is a logical next step. After defining some objective function, a new question arises:
which value should be given to the variables in order to reach this objective? It is interesting to note
that for root-finding problems, one important strategy in recent research and applications, in
particular in interaction problems, is the use of multi-secant (or multi-points) Quasi-Newton
methods. However, this strategy has been very little explored in the context of optimization where
symmetrical methods (BFGS in the lead) are the most used. It can be shown that the multi-secant
property and the symmetry are generally mutually exclusive [Quasi-Newton Methods Using Multiple
Secant Equations, Schnabel 83]. Although, as multi-secant methods perform very well for root-
finding problems, we are interested in the application of those methods in optimization. In order to
tackle the stated general impossibility to develop a symmetric multi-secant Quasi-Newton update
formula, we expose three strategies and give an overview of some of their recent results: data
perturbation, penalized methods and alternating projections.