Augmented Newton Method for Optimization: Global Linear Rate and Momentum Interpretation

05/23/2022
by   Md Sarowar Morshed, et al.
0

We propose two variants of Newton method for solving unconstrained minimization problem. Our method leverages optimization techniques such as penalty and augmented Lagrangian method to generate novel variants of the Newton method namely the Penalty Newton method and the Augmented Newton method. In doing so, we recover several well-known existing Newton method variants such as Damped Newton, Levenberg, and Levenberg-Marquardt methods as special cases. Moreover, the proposed Augmented Newton method can be interpreted as Newton method with adaptive heavy ball momentum. We provide global convergence results for the proposed methods under mild assumptions that hold for a wide variety of problems. The proposed methods can be sought as the penalty and augmented extensions of the results obtained by Karimireddy et. al [24].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/12/2022

ALS: Augmented Lagrangian Sketching Methods for Linear Systems

We develop two fundamental stochastic sketching techniques; Penalty Sket...
research
05/17/2022

Penalty Augmented Kaczmarz Methods For Linear Systems Linear Feasibility Problems

In this work, we shed light on the so-called Kaczmarz method for solving...
research
08/28/2020

An Efficient Augmented Lagrangian Method with Semismooth Newton Solver for Total Generalized Variation

Total generalization variation (TGV) is a very powerful and important re...
research
04/27/2021

Discriminative Bayesian Filtering Lends Momentum to the Stochastic Newton Method for Minimizing Log-Convex Functions

To minimize the average of a set of log-convex functions, the stochastic...
research
06/09/2023

Newton-based alternating methods for the ground state of a class of multi-component Bose-Einstein condensates

The computation of the ground states of special multi-component Bose-Ein...
research
02/17/2020

A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization

We demonstrate how to scalably solve a class of constrained self-concord...

Please sign up or login with your details

Forgot password? Click here to reset