Related papers: Locally Unitarily Invariantizable NEPv and Converg…
The NEPv approach has been increasingly used lately for optimization on the Stiefel manifold arising from machine learning. General speaking, the approach first turns the first order optimality condition, also known as the KKT condition,…
This paper concerns a class of monotone eigenvalue problems with eigenvector nonlinearities (mNEPv). The mNEPv is encountered in applications such as the computation of joint numerical radius of matrices, best rank-one approximation of…
We present a comprehensive convergence analysis for Self-Consistent Field (SCF) iteration to solve a class of nonlinear eigenvalue problems with eigenvector-dependency (NEPv). Using a tangent-angle matrix as an intermediate measure for…
Nonlinear eigenvalue problems with eigenvector nonlinearities (NEPv) are algebraic eigenvalue problems whose matrix depends on the eigenvector. Applications range from computational quantum mechanics to machine learning. Due to its…
We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear…
In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant…
The eigenvector-dependent nonlinear eigenvalue problem (NEPv) $A(P)V=V\Lambda$, where the columns of $V\in\mathbb{C}^{n\times k}$ are orthonormal, $P=VV^{\mathrm{H}}$, $A(P)$ is Hermitian, and $\Lambda=V^{\mathrm{H}}A(P)V$, arises in many…
Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…
Non-convex optimization problems can be approximately solved via relaxation or local algorithms. For many practical problems such as optimal power flow (OPF) problems, both approaches tend to succeed in the sense that relaxation is usually…
Recently, Conditional Neural Fields (NeFs) have emerged as a powerful modelling paradigm for PDEs, by learning solutions as flows in the latent space of the Conditional NeF. Although benefiting from favourable properties of NeFs such as…
We analyze the behavior of the eigenvalues of the following non local mixed problem $\left\{ \begin{array}{rcll} (-\Delta)^{s} u &=& \lambda_1(D) \ u &\inn\Omega,\\ u&=&0&\inn D,\\ \mathcal{N}_{s}u&=&0&\inn N. \end{array}\right $ Our goal…
This work studies low-rank approximation of a positive semidefinite matrix from partial entries via nonconvex optimization. We characterized how well local-minimum based low-rank factorization approximates a fixed positive semidefinite…
This paper deals with the existence and uniqueness of solutions to kinetic equations describing alignment of self-propelled particles. The particularity of these models is that the velocity variable is not on the euclidean space but…
In this paper we consider the training of single hidden layer neural networks by pseudoinversion, which, in spite of its popularity, is sometimes affected by numerical instability issues. Regularization is known to be effective in such…
This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the…
In this paper, we present a local convergence analysis of the self-consistent field (SCF) iteration using the density matrix as the state of a fixed-point iteration. Sufficient and almost necessary conditions for local convergence are…
Non-locality is being intensively studied in various PDE-contexts and in variational problems. The numerical approximation also looks challenging, as well as the application of these models to Continuum Mechanics and Image Analysis, among…
We examine the \emph{submodular maximum coverage problem} (SMCP), which is related to a wide range of applications. We provide the first variational approximation for this problem based on the Nemhauser divergence, and show that it can be…
In this note we provide conditions for local invariance of finite dimensional submanifolds for solutions to stochastic partial differential equations (SPDEs) in the framework of the variational approach. For this purpose, we provide a…
In this paper, we study the local convergence of the standard ADMM scheme for a class of nonconvex composite problems arising from modern imaging and machine learning models. This problem is constrained by a closed convex set, while its…