Global Convergence of Triangularized Orthogonalization-free Method

10/12/2021
by   Weiguo Gao, et al.
0

This paper proves the global convergence of a triangularized orthogonalization-free method (TriOFM). TriOFM, in general, applies a triangularization idea to the gradient of an objective function and removes the rotation invariance in minimizers. More precisely, in this paper, the TriOFM works as an eigensolver for sizeable sparse matrices and obtains eigenvectors without any orthogonalization step. Due to the triangularization, the iteration is a discrete-time flow in a non-conservative vector field. The global convergence relies on the stable manifold theorem, whereas the convergence to stationary points is proved in detail in this paper. We provide two proofs inspired by the noisy power method and the noisy optimization method, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2018

Proximal Gradient Method for Manifold Optimization

This paper considers manifold optimization problems with nonsmooth and n...
research
08/12/2020

Distributed Gradient Flow: Nonsmoothness, Nonconvexity, and Saddle Point Evasion

The paper considers distributed gradient flow (DGF) for multi-agent nonc...
research
07/30/2022

A Gradient Smoothed Functional Algorithm with Truncated Cauchy Random Perturbations for Stochastic Optimization

In this paper, we present a stochastic gradient algorithm for minimizing...
research
10/29/2019

Efficiently avoiding saddle points with zero order methods: No gradients required

We consider the case of derivative-free algorithms for non-convex optimi...
research
08/07/2019

Distributed Gradient Descent: Nonconvergence to Saddle Points and the Stable-Manifold Theorem

The paper studies a distributed gradient descent (DGD) process and consi...
research
11/10/2020

Locking free staggered DG method for the Biot system of poroelasticity on general polygonal meshes

In this paper we propose and analyze a staggered discontinuous Galerkin ...
research
05/24/2022

Accelerating Frank-Wolfe via Averaging Step Directions

The Frank-Wolfe method is a popular method in sparse constrained optimiz...

Please sign up or login with your details

Forgot password? Click here to reset