Nonlinear Spectral Duality
From MaRDI portal
Publication:6410643
arXiv2209.06241MaRDI QIDQ6410643FDOQ6410643
Publication date: 13 September 2022
Abstract: Nonlinear eigenvalue problems for pairs of homogeneous convex functions are particular nonlinear constrained optimization problems that arise in a variety of settings, including graph mining, machine learning, and network science. By considering different notions of duality transforms from both classical and recent convex geometry theory, in this work we show that one can move from the primal to the dual nonlinear eigenvalue formulation maintaining the spectrum, the variational spectrum as well as the corresponding multiplicities unchanged. These nonlinear spectral duality properties can be used to transform the original optimization problem into various alternative and possibly more treatable dual problems. We illustrate the use of nonlinear spectral duality in a variety of example settings involving optimization problems on graphs, nonlinear Laplacians, and distances between convex bodies.
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Optimality conditions and duality in mathematical programming (90C46) Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41) Duality theory (optimization) (49N15) Nonlinear spectral theory, nonlinear eigenvalue problems (47J10)
This page was built for publication: Nonlinear Spectral Duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410643)
