Convergence of SCF for Locally Unitarily Invariantizable NEPv

12/28/2022
by   Ding Lu, et al.
0

We consider a class of eigenvector-dependent nonlinear eigenvalue problems (NEPv) without the unitary invariance property. Those NEPv commonly arise as the first-order optimality conditions of a particular type of optimization problems over the Stiefel manifold, and previously, special cases have been studied in the literature. Two necessary conditions, a definiteness condition and a rank-preserving condition, on an eigenbasis matrix of the NEPv that is a global optimizer of the associated problem optimization are revealed, where the definiteness condition has been known for the special cases previously investigated. We show that, locally close to the eigenbasis matrix satisfying both necessary conditions, the NEPv can be reformulated as a unitarily invariant NEPv, the so-called aligned NEPv, through a basis alignment operation – in other words, the NEPv is locally unitarily invariantizable. Numerically, the NEPv is naturally solved by an SCF-type iteration. By exploiting the differentiability of the coefficient matrix of the aligned NEPv, we establish a closed-form local convergence rate for the SCF-type iteration and analyze its level-shifted variant. Numerical experiments confirm our theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2020

Optimal Convergence Rate of Self-Consistent Field Iteration for Solving Eigenvector-dependent Nonlinear Eigenvalue Problems

We present a comprehensive convergence analysis for Self-Consistent Fiel...
research
05/23/2019

Scale Invariant Power Iteration

Power iteration has been generalized to solve many interesting problems ...
research
03/09/2023

2D Eigenvalue Problem III: Convergence Analysis of the 2D Rayleigh Quotient Iteration

In Part I of this paper, we introduced a two dimensional eigenvalue prob...
research
06/19/2022

Rank-1 matrix differential equations for structured eigenvalue optimization

A new approach to solving eigenvalue optimization problems for large str...
research
08/19/2023

Complexity Guarantees for Nonconvex Newton-MR Under Inexact Hessian Information

We consider extensions of the Newton-MR algorithm for nonconvex optimiza...
research
01/12/2021

Trace Ratio Optimization with an Application to Multi-view Learning

A trace ratio optimization problem over the Stiefel manifold is investig...
research
02/24/2014

A Technique for Deriving Equational Conditions on the Denavit-Hartenberg Parameters of 6R Linkages that are Necessary for Movability

A closed 6R linkage is generically rigid. Special cases may be mobile. M...

Please sign up or login with your details

Forgot password? Click here to reset