New Step-Size Criterion for the Steepest Descent based on Geometric Numerical Integration

10/29/2021
by   Kenya Onuma, et al.
0

This paper deals with unconstrained optimization problems based on numerical analysis of ordinary differential equations (ODEs). Although it has been known for a long time that there is a relation between optimization methods and discretization of ODEs, research in this direction has recently been gaining attention. In recent studies, the dissipation laws of ODEs have often played an important role. By contrast, in the context of numerical analysis, a technique called geometric numerical integration, which explores discretization to maintain geometrical properties such as the dissipation law, is actively studied. However, in research investigating the relationship between optimization and ODEs, techniques of geometric numerical integration have not been sufficiently investigated. In this paper, we show that a recent geometric numerical integration technique for gradient flow reads a new step-size criterion for the steepest descent method. Consequently, owing to the discrete dissipation law, convergence rates can be proved in a form similar to the discussion in ODEs. Although the proposed method is a variant of the existing steepest descent method, it is suggested that various analyses of the optimization methods via ODEs can be performed in the same way after discretization using geometric numerical integration.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2022

Discretization of inherent ODEs and the geometric integration of DAEs with symmetries

Discretization methods for differential-algebraic equations (DAEs) are c...
research
09/13/2021

Minimizing Quantum Renyi Divergences via Mirror Descent with Polyak Step Size

Quantum information quantities play a substantial role in characterizing...
research
08/12/2013

Faster gradient descent and the efficient recovery of images

Much recent attention has been devoted to gradient descent algorithms wh...
research
11/06/2020

On the Ergodicity, Bias and Asymptotic Normality of Randomized Midpoint Sampling Method

The randomized midpoint method, proposed by [SL19], has emerged as an op...
research
06/07/2023

Modelling the discretization error of initial value problems using the Wishart distribution

This paper presents a new discretization error quantification method for...
research
07/23/2021

Optimization on manifolds: A symplectic approach

There has been great interest in using tools from dynamical systems and ...
research
01/26/2023

First Order Methods for Geometric Optimization of Crystal Structures

The geometric optimization of crystal structures is a procedure widely u...

Please sign up or login with your details

Forgot password? Click here to reset