Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates

11/06/2020
by   Damien Scieur, et al.
0

Quasi-Newton techniques approximate the Newton step by estimating the Hessian using the so-called secant equations. Some of these methods compute the Hessian using several secant equations but produce non-symmetric updates. Other quasi-Newton schemes, such as BFGS, enforce symmetry but cannot satisfy more than one secant equation. We propose a new type of quasi-Newton symmetric update using several secant equations in a least-squares sense. Our approach generalizes and unifies the design of quasi-Newton updates and satisfies provable robustness guarantees.

READ FULL TEXT
research
07/13/2021

A New Multipoint Symmetric Secant Method with a Dense Initial Matrix

In large-scale optimization, when either forming or storing Hessian matr...
research
02/04/2022

A J-Symmetric Quasi-Newton Method for Minimax Problems

Minimax problems have gained tremendous attentions across the optimizati...
research
03/09/2023

Provably Convergent Plug-and-Play Quasi-Newton Methods

Plug-and-Play (PnP) methods are a class of efficient iterative methods t...
research
10/11/2022

Learning to Optimize Quasi-Newton Methods

We introduce a novel machine learning optimizer called LODO, which onlin...
research
09/03/2020

On a non-archimedean broyden method

Newton's method is an ubiquitous tool to solve equations, both in the ar...
research
10/01/2020

Single-stage gradient-based stellarator coil design: Optimization for near-axis quasi-symmetry

We present a new coil design paradigm for magnetic confinement in stella...
research
01/04/2020

Compact Quasi-Newton preconditioners for SPD linear systems

In this paper preconditioners for the Conjugate Gradient method are stud...

Please sign up or login with your details

Forgot password? Click here to reset