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

08/28/2020
by   Hongpeng Sun, et al.
0

Total generalization variation (TGV) is a very powerful and important regularization for image restoration and various computer vision tasks. In this paper, we proposed a semismooth Newton method based augmented Lagrangian method to solve this problem. Augmented Lagrangian method (also called as method of multipliers) is widely used for lots of smooth or nonsmooth variational problems. However, its efficiency usually heavily depends on solving the coupled and nonlinear system together and simultaneously, which is very complicated and highly coupled for total generalization variation. With efficient primal-dual semismooth Newton method for the complicated linear subproblems involving total generalized variation, we investigated a highly efficient and competitive algorithm compared to some popular first-order method. With the analysis of the metric subregularities of the corresponding functions, we give both the global convergence and local linear convergence rate for the proposed augmented Lagrangian methods with semismooth Newton solvers.

READ FULL TEXT

page 18

page 20

research
10/03/2019

A sparse semismooth Newton based augmented Lagrangian method for large-scale support vector machines

Support vector machines (SVMs) are successful modeling and prediction to...
research
10/05/2022

ProxNLP: a primal-dual augmented Lagrangian solver for nonlinear programming in Robotics and beyond

Mathematical optimization is the workhorse behind several aspects of mod...
research
02/24/2020

An Overlapping Domain Decomposition Framework without Dual Formulation for Variational Imaging Problems

In this paper, we propose a novel overlapping domain decomposition metho...
research
05/23/2022

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

We propose two variants of Newton method for solving unconstrained minim...
research
11/02/2022

An efficient algorithm for the ℓ_p norm based metric nearness problem

Given a dissimilarity matrix, the metric nearness problem is to find the...
research
09/05/2017

Newton-type Methods for Inference in Higher-Order Markov Random Fields

Linear programming relaxations are central to map inference in discrete...
research
06/11/2020

IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method

We introduce a framework for designing primal methods under the decentra...

Please sign up or login with your details

Forgot password? Click here to reset